力扣347：前K个高频元素

java的PriorityQueue放入HashMap的键值对，并按照HashMap的value值进行最大优先队列排列

下面的方法是将nums里的元素频率最高的前k个元素存放到List里返回
public List<Integer> top(int[] nums, int k) {
    HashMap<Integer, Integer> map = new HashMap<>();
    for (int i : nums) {
        int count = map.getOrDefault(i, 0);
        map.put(i, count + 1);
    }
 
    PriorityQueue<Map.Entry<Integer, Integer>> priorityQueue = new PriorityQueue<>(new Comparator<Map.Entry<Integer, Integer>>() {
        @Override
        public int compare(Map.Entry<Integer, Integer> o1, Map.Entry<Integer, Integer> o2) {
            return o2.getValue().compareTo(o1.getValue());
        }
    });
    for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
        priorityQueue.add(entry);
    }
    List<Integer> list = new ArrayList<>();
    for (int i = 0; i < k; i++) {
        list.add(priorityQueue.remove().getKey());
    }
    return list;
}

class Solution {
    public int[] topKFrequent(int[] nums, int k) {
        int[] result = new int[k];
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int num : nums) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }

        Set<Map.Entry<Integer, Integer>> entries = map.entrySet();
        // 根据map的value值正序排，相当于一个小顶堆
        PriorityQueue<Map.Entry<Integer, Integer>> queue = new PriorityQueue<>((o1, o2) -> o1.getValue() - o2.getValue());
        for (Map.Entry<Integer, Integer> entry : entries) {
            queue.offer(entry);
            if (queue.size() > k) {
                queue.poll();
            }
        }
        for (int i = k - 1; i >= 0; i--) {
            result[i] = queue.poll().getKey();
        }
        return result;
    }
}