【每日打卡】Day2：众数问题的Java实现

 众数问题，将数组排序后转换为字符串，再采用字符串的性质，获取重复元素个数，代码运行效率较高

import java.util.*;
public class Main {
    public static void solve(int arr[]){
        Arrays.sort(arr);
        List<Integer> list = new ArrayList<>();
        for(int i = 0; i < arr.length; i ++)
            list.add(arr[i]);
        //System.out.println(list.indexOf(2) + " " + list.lastIndexOf(3));
        int ans[] = new int[arr.length];
        for(int i = 0; i < arr.length; i ++){
            ans[i] = list.lastIndexOf(arr[i]) - list.indexOf(arr[i]) + 1;
        }
        int index = 0;
        for(int i = 1; i < ans.length; i ++){
            if(ans[i] > ans[i-1]){
                index = i;
            }
        }
        System.out.println(arr[index]);
        System.out.println(ans[index]);
    }
    public static void main(String []args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a[] = new int[n];
        for(int i = 0; i < n; i ++)
            a[i] = sc.nextInt();
        solve(a);
    }
}