347. Top K Frequent Elements

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

Example 1:

Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]
Example 2:

Input: nums = [1], k = 1
Output: [1]

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.

使用map存储key以及对应的freq，然后用尺寸为k的小堆进行排序，输出小堆中的key即可。

class Solution {
    public List<Integer> topKFrequent(int[] nums, int k) {
        List<Integer> result = new ArrayList<>();
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : nums) {
            if (map.containsKey(num)) {
                map.put(num, map.get(num) + 1);
            } else {
               map.put(num, 1); 
            }
        }
        PriorityQueue<Integer> minHeap = new PriorityQueue<>(
            (o1, o2) -> Integer.compare(map.get(o1), map.get(o2)));
        
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (minHeap.size() >= k) {
                if (map.get(minHeap.peek()) < entry.getValue()) {
                    minHeap.poll();
                } else {
                    continue;
                }
            }
            minHeap.add(entry.getKey());
        }
        for (Integer key : minHeap) {
            result.add(key);
        }
        return result;
    }
}

注意： 小堆里可以只存放key，然后排序的方法中，使用

 (o1, o2) -> Integer.compare(map.get(o1), map.get(o2))

解法二： 使用桶排序
同样，需要map中记录key和freq。 然后建一个大小为nums.length + 1的桶数组，存放freq对应的list。
最后，从后向前输出k个list即可。

public List<Integer> topKFrequent(int[] nums, int k) {

	List<Integer>[] bucket = new List[nums.length + 1];
	Map<Integer, Integer> frequencyMap = new HashMap<Integer, Integer>();

	for (int n : nums) {
		frequencyMap.put(n, frequencyMap.getOrDefault(n, 0) + 1);
	}

	for (int key : frequencyMap.keySet()) {
		int frequency = frequencyMap.get(key);
		if (bucket[frequency] == null) {
			bucket[frequency] = new ArrayList<>();
		}
		bucket[frequency].add(key);
	}

	List<Integer> res = new ArrayList<>();

	for (int pos = bucket.length - 1; pos >= 0 && res.size() < k; pos--) {
		if (bucket[pos] != null) {
			res.addAll(bucket[pos]);
		}
	}
	return res;
}