Java HashMap按value进行排序

public void FindNumsAppearOnce(int [] array,int num1[] , int num2[]) {
        if(array.length<=0|| array==null)   return;
        HashMap<Integer,Integer> map=new HashMap<>();
        for(int i=0;i<array.length;i++){
            if(map.containsKey(array[i])){
                int count=map.get(array[i]);
                map.put(array[i],++count);
            }else{
                map.put(array[i],1);
            }
        }
        List<Map.Entry<Integer,Integer>> list=new ArrayList<>(map.entrySet());
        Collections.sort(list, new Comparator<Map.Entry<Integer, Integer>>() {
            @Override
            public int compare(Map.Entry<Integer, Integer> o1, Map.Entry<Integer, Integer> o2) {
                return o1.getValue().compareTo(o2.getValue());
            }
        });
        num1[0]=list.get(0).getKey();
        num2[0]=list.get(1).getKey();
    }