android获得字符串数组中出现次数最多的字符串

  public static String findMaxString(String[] arr) {

        Map<Integer, String> map = new HashMap<Integer, String>();
        for (int i = 0; i < arr.length - 1; i++) {
            int count = 0;
            String temp = null;
            for (int j = i + 1; j < arr.length; j++) {

                if (arr[i].equals(arr[j])) {

                    count++;
                    temp = arr[i];
                }


            }
//从第一个字符开始比较,每次比较完成后,将相同字符的数目和字符储存在map中
            map.put(count + 1, temp);


        }

        int[] countArr = new int[map.size()];
        for (int c : map.keySet()) {

            for (int i = 0; i < map.size(); i++) {
//将map集合的键存储在数组中
                countArr[i] = c;
            }
        }

        Arrays.sort(countArr);
        int MAXCOUNT = countArr[countArr.length - 1];
        String maxvalue = map.get(MAXCOUNT);
        String[] maxString = new String[MAXCOUNT];
        for (int i = 0; i < MAXCOUNT; i++) {
            maxString[i] = maxvalue;
        }
        return maxvalue;
    }

猜你喜欢

转载自blog.csdn.net/qq_30081107/article/details/52671222