leetcode347. 前 K 个高频元素

class Solution {
    public int[] topKFrequent(int[] nums, int k) {
        //先统计各个数字的频率
        Map<Integer,Integer> occurence = new HashMap<>();
        for(int i = 0;i < nums.length;i++)
            occurence.put(nums[i],occurence.getOrDefault(nums[i],0) + 1);
        List<Integer>[] bucket = new ArrayList[nums.length];
        //桶排序
        for(Map.Entry<Integer,Integer> entry : occurence.entrySet()){
            int key = entry.getKey(),value = entry.getValue();
            if(bucket[value-1] == null)
                bucket[value-1] = new ArrayList();
            bucket[value - 1].add(key);
        }
        int[] result = new int[k];
        int index = 0;
        for(int i = nums.length-1;i >= 0;i--){
            List<Integer> list = bucket[i];
            if(list == null)
                continue;
            for(int j = 0;j < list.size();j++){
                result[index++] = list.get(j);
            }
            if(index >= k)
                break;
        }
        return result;
    }
}