原文链接http://blog.csdn.net/li563868273/article/details/51484932
题目
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.
解
public class Solution {
public List<Integer> topKFrequent(int[] nums, int k) {
//利用hashMap,和优先级队列。
List<Integer> res=new ArrayList<Integer>();
Map<Integer,Integer> map=new HashMap<Integer,Integer>();
if(k>nums.length||k<1){
return res;
}
for(int num:nums){
if(map.containsKey(num)){
map.put(num,map.get(num)+1);
}else{
map.put(num,1);
}
}
ArrayList<Map.Entry<Integer,Integer>> list = new ArrayList<Map.Entry<Integer, Integer>>(map.entrySet());
Collections.sort(list, new Comparator<Map.Entry<Integer, Integer>>() {
@Override
public int compare(Map.Entry<Integer, Integer> o1, Map.Entry<Integer, Integer> o2) {
return o2.getValue() - o1.getValue();
}
});
int count = 0;
while (count < k)
res.add(list.get(count++).getKey());
return res;
}
}