-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution347.java
More file actions
43 lines (39 loc) · 1.18 KB
/
Copy pathsolution347.java
File metadata and controls
43 lines (39 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class solution347 {
public List<Integer> topKFrequent(int[] nums, int k) {
Map<Integer,Integer> frequencyForNum = new HashMap<>();
for(int num : nums)
{
frequencyForNum.put(num,frequencyForNum.getOrDefault(num,0)+1);
}
ArrayList[] buckects = new ArrayList[nums.length+1];
for(int key:frequencyForNum.keySet())
{
int frequency = frequencyForNum.get(key);
if(buckects[frequency] == null)
{
buckects[frequency] = new ArrayList();
}
buckects[frequency].add(key);
}
ArrayList<Integer> topk = new ArrayList<>();
for(int i = buckects.length-1;i>=0&&topk.size()<k;i--)
{
if(buckects[i] == null)
{
continue;
}
if(buckects[i].size() <= (k-topk.size()))
{
topk.addAll(buckects[i]);
}
else{
topk.addAll(buckects[i].subList(0,k-topk.size()));
}
}
return topk;
}
}