-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
692.java
166 lines (137 loc) · 4.1 KB
/
692.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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
__________________________________________________________________________________________________
sample 3 ms submission
class Solution {
//排名第一的答案,我不信,要试试。
int index = 0;
TNode list[];
public List<String> topKFrequent(String[] words, int k) {
List<String> result = new ArrayList<>();
TNode root = new TNode();
list = new TNode[words.length];
for(String word: words) {
addWord(root, word);
}
mergeSort(list,0, index-1);
/*/ Comparator<TNode> com=new Comparator<TNode>(){
@Override
public int compare(TNode o1,TNode o2){
if(o1==null)
if(o2==null)
return 0;
else
return 1;
else
if(o2==null)
return -1;
else
return o1.frequency==o2.frequency?o1.word.compareTo(o2.word):o2.frequency-o1.frequency;
}
};
Arrays.sort(list,com);/*/
for(int i = 0; i < k; ++i) {
result.add(list[i].word);
}
return result;
}
private void mergeSort(TNode[] list, int m, int n) {
if(m < n) {
int mid = m + (n-m)/2;
mergeSort(list, m, mid);
mergeSort(list, mid+1, n);
merging(list,m,mid,n);
}
}
private void merging(TNode[] list, int m, int mid, int n) {
TNode[] temp = new TNode[n-m+1];
int i = m;
int j = mid+1;
int k = 0;
while(i <= mid && j <= n) {
if(list[i].frequency > list[j].frequency) {
temp[k++] = list[i++];
}
else if(list[i].frequency < list[j].frequency) {
temp[k++] = list[j++];
}
else if(compareWords(list[i].word, list[j].word)) {
temp[k++] = list[i++];
}
else {
temp[k++] = list[j++];
}
}
while(i <= mid) {
temp[k++] = list[i++];
}
while(j <= n) {
temp[k++] = list[j++];
}
k = 0;
for(i = m; i <= n;) {
list[i++] = temp[k++];
}
}
protected boolean compareWords(String word1, String word2) {
for(int i = 0; i < word1.length() && i < word2.length(); ++i) {
if(word1.charAt(i) < word2.charAt(i))
return true;
if(word1.charAt(i) > word2.charAt(i))
return false;
}
return word1.length() < word2.length()?true:false;
}
private void addWord(TNode root, String word) {
for(int i = 0; i < word.length(); ++i) {
if(null == root.next[word.charAt(i)-'a']) {
root.next[word.charAt(i)-'a'] = new TNode();
}
root = root.next[word.charAt(i)-'a'];
}
if(0 == root.frequency) {
list[index++] = root;
root.word = word;
}
root.frequency++;
}
}
class TNode {
TNode next[];
int frequency;
String word;
public TNode() {
next = new TNode[26];
frequency = 0;
}
}
__________________________________________________________________________________________________
sample 35360 kb submission
class Solution {
public List<String> topKFrequent(String[] words, int k) {
Map<String,Integer> map = new HashMap();
//List<String> res = new ArrayList();
for(String word:words)
{
System.out.println(word);
map.put(word,map.getOrDefault(word,0)+1);
}
/*
List<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>(map.entrySet());
java.util.Collections.sort(list);
Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
return (o2.getValue() - o1.getValue());
}
});
for(int i=0;i<k;i++)
{
System.out.println(list.get(i));
res.add(list.get(i).getKey());
}
*/
List<String> candidates = new ArrayList(map.keySet());
Collections.sort(candidates, (w1, w2) -> map.get(w1).equals(map.get(w2)) ?
w1.compareTo(w2) : map.get(w2) - map.get(w1));
return candidates.subList(0, k);
}
}
__________________________________________________________________________________________________