整数数组按频率和大小排序

import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;

public class tt {
    public static void main(String[] args){
        //数字排序，按频率由低到高，相同频率按数字大小排序
        Integer[] array = {12,12,6,6,8,0,1,2,1,3,8,1,45};
        Map<Integer,Integer> m = new HashMap<>();

        for(int d : array){
            m.put(d,m.get(d)==null ? 1 : m.get(d)+1);
        }

        System.out.println("map:" + m);
        System.out.println("origin:" + Arrays.toString(array));

        Comparator<Integer> comparator = new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                if(m.get(o1) != m.get(o2)){
                    return Integer.compare(m.get(o1),m.get(o2));
                }else {
                    return Integer.compare(o1,o2);
                }
            }
        };

        Arrays.sort(array,comparator);
        System.out.println("after sort:"+Arrays.toString(array));
    }
}