347. Top K Frequent Elements
- Total Accepted: 24084
- Total Submissions: 55147
- Difficulty: Medium
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.
思路:
1. 将全部元素放到 Hashtable 里面,统计各个元素的出现次数
2. 将 Hashtable 里面的全部 Entry 拷贝一份到 List<Entry> 里面
3. 根据元素出现次数的值,对 List<Entry> 里面的元素进行排序
4. 将 List<Entry> 中出现次数的值最最大的前 k 个拷贝到一个新的 List<Integer> 中,得到结果
import java.util.Collections;
import java.util.Comparator;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map.Entry;
public class Solution {
class Comparatr implements Comparator<Entry<?,Integer>>{
public int compare(Entry<?,Integer>o1,Entry<?,Integer> o2){
return o2.getValue().compareTo(o1.getValue());
}
}
public List<Integer> topKFrequent(int[] nums, int k) {
TreeMap<Integer,Integer> hm = new TreeMap<Integer,Integer>();
List<Integer> list = new LinkedList<Integer>();
int length = nums.length;
if(length==0||k==0)return list;
if(length==1){
list.add(nums[0]);
return list;
}
//1、把全部元素放到Map里面,统计各个元素出现的次数。
for(int i=0;i<length;i++){
if(hm.containsKey(nums[i])==false) hm.put(nums[i],1);
else{
int temp = hm.get(nums[i]);
hm.put(nums[i],temp+1);
}
}
//2.把hashmap(或者Treemap都可以)中的EntrySet拷贝一份到list<Entry>里面
List<Entry<Integer,Integer>> entrylist = new LinkedList<Entry<Integer,Integer>>(hm.entrySet());
//3.根据出现次数的值,对List<entry>元素排序
Comparatr cmp = new Comparatr();
Collections.sort(entrylist,cmp);
entrylist.subList(k,entrylist.size()).clear();
//4.将前k个出现次数最大的放到新的List<integer>里面,返回
List<Integer> res = new LinkedList<Integer>();
Iterator<Entry<Integer,Integer>> itr = entrylist.iterator();
while(itr.hasNext()){
Entry<Integer,Integer> entry = itr.next();
res.add(entry.getKey());
}
return res;
}
}