-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
36 lines (32 loc) · 1.23 KB
/
Solution.java
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
class Solution {
class Frequency {
String word;
int frequency;
Frequency(String word, int frequency) {
this.word = word;
this.frequency = frequency;
}
}
public List<String> topKFrequent(String[] words, int k) {
Map<String, Integer> frequencyMap = new HashMap<String, Integer>();
for (String word : words) {
if (frequencyMap.get(word) == null)
frequencyMap.put(word, 1);
else
frequencyMap.put(word, frequencyMap.get(word) + 1);
}
Comparator<Frequency> frequencyComparator = new Comparator<Frequency>() {
public int compare(Frequency a, Frequency b) {
return a.frequency > b.frequency ? -1 : (a.frequency == b.frequency ? a.word.compareTo(b.word) : 1);
}
};
Queue<Frequency> queue = new PriorityQueue<Frequency>(frequencyComparator);
for (String word : frequencyMap.keySet()) {
queue.add(new Frequency(word, frequencyMap.get(word)));
}
List<String> res = new ArrayList<String>();
for (int i = 0; i < k; i++)
res.add(queue.poll().word);
return res;
}
}