leetcode347. Top K Frequent Elements

题目：

347. Top K Frequent Elements

Medium

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]

思路：

代码：

Java

class Solution {
    public int[] topKFrequent(int[] nums, int k) {
        List<Integer>[] bucket=new List[nums.length+1];
        Map<Integer,Integer> frequency=new HashMap<>();
        for(int num:nums){
            frequency.put(num,frequency.getOrDefault(num,0)+1);
        }
        for(int key:frequency.keySet()){
            int fre=frequency.get(key);
            if(bucket[fre]==null){
                bucket[fre]=new ArrayList<>();
            }
            bucket[fre].add(key);
        }
        List<Integer> res=new ArrayList<>();
        for(int i=bucket.length-1;i>=0&&res.size()<k;--i){
            if(bucket[i]!=null){
                res.addAll(bucket[i]);
            }
        }
        int[] arr = res.stream().mapToInt(Integer::valueOf).toArray();//List<Integer> 转 int[]
        return arr;
    }
}