华为算法题1

华为笔试（输如：人名（用“,”隔开，代表投票数，输出活得票数最多的人，若票数相同比较人名大小）

import java.util.*;


public class Main {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        String  str = sc.nextLine();
        String[] strs = str.split(",");
        ArrayList strs1 = new ArrayList<>();
        for(int i = 0; i < strs.length; i++){
            strs1.add(strs[i]);
        }
        String resu = myFun(strs1);
        System.out.println(resu);
    }
    public static String myFun(ArrayList strs1){
        Map resu = new TreeMap<>( );
       // ArrayList lastResu = new ArrayList<>();
        for(int i = 0; i < strs1.size(); i++){
            if(strs1.get(i).charAt(0)< 'A' || strs1.get(i).charAt(0) > 'Z')
                return "error.0001";
            for(int j = 1; j < strs1.get(i).length(); j++){
                if(strs1.get(i).charAt(j) < 'a' || strs1.get(i).charAt(j) > 'z')
                    return "error.0001";
            }
            if(resu.containsKey(strs1.get(i))){
                int temp = resu.get(strs1.get(i));
                temp++;
                resu.put(strs1.get(i),temp);
            }
            else{
                resu.put(strs1.get(i),1);
            }
        }
        List> list = new ArrayList>(resu.entrySet());
        Collections.sort(list, new Comparator>() {
            @Override
            public int compare(Map.Entry o1, Map.Entry o2) {
                if (o2.getValue().compareTo(o1.getValue()) == 0) {
                    return o1.getKey().compareTo(o2.getKey());
                } else {
                    return o2.getValue().compareTo(o1.getValue());             }

            }
        });
        String resuLast = list.get(0).getKey();
        return resuLast;
    }

}

）