347. 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.

---

首先将数据录入HashMap中，然后根据Value排序，最后输出。
值得注意的是，在将Set<Map.Entry<Integer, Integer>>变为数组时候使用set.toArray的方法。以及建立compare时候的类的定义是Map.Entry<Integer, Integer>而不是Map.Entry

class Solution {
    public List<Integer> topKFrequent(int[] nums, int k) {
        Map<Integer, Integer> map = new HashMap<>();
        for(int n : nums){
            if(map.containsKey(n))
                map.put(n, map.get(n)+1);
            else
                map.put(n, 1);
        }
        Set<Map.Entry<Integer, Integer>> entry = map.entrySet();
        Map.Entry<Integer, Integer>[] entArr = (Map.Entry[]) entry.toArray(new Map.Entry[entry.size()]);      // 注意！
        Arrays.sort(entArr, new Comparator<Map.Entry<Integer, Integer>>(){
            public int compare(Map.Entry<Integer, Integer> a, Map.Entry<Integer, Integer> b){
                return b.getValue() - a.getValue();
            }
        });
        List<Integer> res = new ArrayList<>();
        for(int i = 0; i < k; i++){
            res.add(entArr[i].getKey());
        }
        return res;

    }
}

---

另一种思路是利用桶的思想，将HashMap统计好的数以Value作为下标将Key值放入链表中，最后从大到小输出链表。

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;
}