forked from algorithm001/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode_692_1.java
More file actions
35 lines (29 loc) · 1.1 KB
/
Copy pathLeetCode_692_1.java
File metadata and controls
35 lines (29 loc) · 1.1 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
class Solution {
public List<String> topKFrequent(String[] words, int k) {
Map<String, Integer> map = new HashMap<>();
int len = words.length;
for (int i = 0; i < len; i ++) {
String word = words[i];
int value = map.getOrDefault(word, 0) + 1;
map.put(word, value);
}
List<Map.Entry<String, Integer>> entrys = new ArrayList<Map.Entry<String, Integer>>(map.entrySet());
Collections.sort(entrys, new Comparator<Map.Entry<String, Integer>>() {
@Override
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
if (o1.getValue() > o2.getValue()){
return -1;
}else if (o1.getValue() < o2.getValue()) {
return 1;
}else {
return o1.getKey().compareTo(o2.getKey());
}
}
});
List<String> result = new ArrayList<>();
for (int i=0; i < k; i ++) {
result.add(entrys.get(i).getKey());
}
return result;
}
}