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.
类似LFU,只不过LFU是使用频率最高的k个数,本题求解找出k个使用频率最高的数,程序如下所示:
class Solution {
public List<Integer> topKFrequent(int[] nums, int k) {
List<Integer> bucket[] = new List[nums.length + 1];
Map<Integer, Integer> map = new HashMap<>();
for (int val : nums){
if (map.containsKey(val)){
map.put(val, map.get(val) + 1);
}
else {
map.put(val, 1);
}
}
Iterator<Map.Entry<Integer, Integer>> iterator = map.entrySet().iterator();
while (iterator.hasNext()){
Map.Entry<Integer, Integer> entry = iterator.next();
if (bucket[entry.getValue()] == null){
bucket[entry.getValue()] = new ArrayList<>();
}
bucket[entry.getValue()].add(entry.getKey());
}
List<Integer> list = new ArrayList<>();
for (int i = bucket.length - 1; i >= 0&&list.size() < k; -- i){
if (bucket[i] != null){
list.addAll(bucket[i]);
}
}
return list;
}
}
本程序有个小问题,就是当数组为[1, 1, 1, 2, 2, 3, 3, 4, 4], k = 2,则会返回[1, 2, 3, 4],与题目要求不符,但是题目说了,值是唯一的,所以不会出现上述数组。
如果一定要规避也是可行的,在最后一个for循环中,往list中添加bucket时,可以一个值一个值添加,当list.size() > k时结束,这样可以控制list中元素个数为k。