Top K Frequent Elements

Given a non-empty array of integers, return the k most frequent elements.

For example,
Given [1,1,1,2,2,3] and k = 2, return [1,2].

Note: 

• You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
• Your algorithm's time complexity must be better than O(n log n), where n is the array's size.

思路：求 Top K 问题，一般都是用 min heap, 如果后进来的元素比当前peek的元素要大，则pop heap ，然后加入最新的元素，这样最后的heap就是保留了最大的k个值。

class Solution {
    class Node {
        public int key;
        public int fre;
        public Node(int key, int fre) {
            this.key = key;
            this.fre = fre;
        }
    }
    
    public int[] topKFrequent(int[] nums, int k) {
        HashMap<Integer, Integer> hashmap = new HashMap<>();
        for(int num: nums) {
            hashmap.put(num, hashmap.getOrDefault(num, 0) + 1);
        }
        PriorityQueue<Node> pq = new PriorityQueue<Node>((a, b) ->(b.fre - a.fre));
        for(Integer key: hashmap.keySet()) {
            pq.offer(new Node(key, hashmap.get(key)));
        }
        int[] res = new int[k];
        int index = 0;
        while(!pq.isEmpty() && k > 0) {
            res[index++] = pq.poll().key;
            k--;
        }
        return res;
    }
}