-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1178.java
324 lines (311 loc) · 9.38 KB
/
1178.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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
__________________________________________________________________________________________________
sample 45 ms submission
class Solution {
private class Node {
int wnum;
Node[] next;
public Node() {
this.wnum = 0;
this.next = new Node[26];
}
}
private char[] puzz;
private int pidx;
private int[] res;
public List<Integer> findNumOfValidWords(String[] words, String[] puzzles) {
Node root = new Node();
res = new int[puzzles.length];
for (String word : words) {
build(root, changeWord(word), 0);
}
for (pidx = 0; pidx < puzzles.length; pidx++) {
puzz = puzzles[pidx].toCharArray();
Arrays.sort(puzz, 0, 7);
int firstChIdx = 0;
char first = puzzles[pidx].charAt(0);
for (int i = 0; i < 7; i++) {
if (puzz[i] == first) {
firstChIdx = i;
break;
}
}
countValid(root, 0, firstChIdx);
}
List<Integer> ans = new ArrayList<>();
for (int r : res) {
ans.add(r);
}
return ans;
}
private void countValid(Node node, int idx, int firstChIdx) {
if (node == null) {
return;
}
if (idx > firstChIdx) {
res[pidx] += node.wnum;
}
if (idx >= 7) {
return;
}
if (idx <= firstChIdx) {
for (int i = idx; i <= firstChIdx; i++) {
countValid(node.next[puzz[i]-'a'], i+1, firstChIdx);
}
} else {
for (int i = idx; i < 7; i++) {
countValid(node.next[puzz[i]-'a'], i+1, firstChIdx);
}
}
}
private int[] changeWord(String word) {
boolean[] table = new boolean[26];
int uniqueCount = 0;
for (int i = 0; i < word.length(); i++) {
int idx = word.charAt(i)-'a';
if (!table[idx]) {
uniqueCount++;
table[idx] = true;
}
}
int[] nWord = new int[uniqueCount];
int nIdx = 0;
for (int i = 0; i < table.length; i++) {
if (table[i]) {
nWord[nIdx++] = i;
}
}
return nWord;
}
private void build(Node node, int[] word, int idx) {
if (node.next[word[idx]] == null) {
node.next[word[idx]] = new Node();
}
if (idx == word.length-1) {
node.next[word[idx]].wnum++;
} else {
build(node.next[word[idx]], word, idx+1);
}
}
}
__________________________________________________________________________________________________
sample 47 ms submission
class Solution {
private Trie t;
private class Trie {
private Node root;
private class Node {
private int count = 0;
private Node[] next = new Node[26];
}
public Trie() {
root = new Node();
}
public void put(char[] arr) {
Arrays.sort(arr);
Node nd = root;
for (int i = 0; i < arr.length; i++) {
if (i > 0 && arr[i] == arr[i - 1]) continue;
int j = arr[i] - 'a';
if (nd.next[j] == null) nd.next[j] = new Node();
nd = nd.next[j];
}
nd.count++;
}
private int search(char[] arr) {
char c = arr[0];
Arrays.sort(arr);
return dfs(arr, 0, c, root, false);
}
private int dfs(char[] arr, int k, char first, Node nd, boolean covered) {
if (k == arr.length) {
return covered ? nd.count : 0;
}
int n = 0;
if (arr[k] != first) {
n += dfs(arr, k + 1, first, nd, covered);
}
else {
covered = true;
}
if (nd.next[arr[k] - 'a'] != null) {
n += dfs(arr, k + 1, first, nd.next[arr[k] - 'a'], covered);
}
return n;
}
}
public List<Integer> findNumOfValidWords(String[] words, String[] puzzles) {
Trie t = new Trie();
for (String s : words) {
t.put(s.toCharArray());
}
// puzzle s = new String[]{"gaswxyz"};
List<Integer> res = new ArrayList<>();
for (String s : puzzles) {
res.add(t.search(s.toCharArray()));
}
return res;
}
}
__________________________________________________________________________________________________
sample 54 ms submission
class Solution {
class TrieNode {
TrieNode[] children;
boolean isWord;
int count;
TrieNode() {
this.children = new TrieNode[26];
this.isWord = false;
this.count = 0;
}
}
public List<Integer> findNumOfValidWords(String[] words, String[] puzzles) {
TrieNode root = new TrieNode();
buildTrie(root, words);
int len = puzzles.length;
List<Integer> res = new ArrayList<>();
for (int i = 0; i < len; i++) {
char[] pz = puzzles[i].toCharArray();
char key = pz[0];
Arrays.sort(pz);
res.add(match(root, pz, key, 0, false));
}
return res;
}
private void buildTrie(TrieNode root, String[] wordlist) {
for (String word : wordlist) {
TrieNode cur = root;
word = simplify(word);
for (char c : word.toCharArray()) {
if (cur.children[c - 'a'] == null) {
cur.children[c - 'a'] = new TrieNode();
}
cur = cur.children[c - 'a'];
}
cur.isWord = true;
cur.count += 1;
}
}
private int match(TrieNode cur, char[] pz, char key, int index, boolean hasKey) {
if (index == pz.length) {
if (!hasKey || !cur.isWord) {
return 0;
}
return cur.count;
}
int res = 0;
char curChar = pz[index];
if (curChar == key) {
if (cur.children[curChar - 'a'] == null) {
return 0;
} else {
hasKey = true;
res += match(cur.children[curChar - 'a'], pz, key, index + 1, hasKey);
return res;
}
} else {
if (cur.children[curChar - 'a'] != null){
res += match(cur.children[curChar - 'a'], pz, key, index + 1, hasKey);
}
res += match(cur, pz, key, index + 1, hasKey);
return res;
}
}
private String simplify(String word) {
char[] sc = word.toCharArray();
Arrays.sort(sc);
StringBuilder sb = new StringBuilder();
for (int i = 0; i < sc.length; i++) {
if (i > 0 && sc[i] == sc[i - 1]) {
continue;
}
sb.append(sc[i]);
}
return sb.toString();
}
}
__________________________________________________________________________________________________
sample 61 ms submission
class Solution {
class TrieNode {
TrieNode[] children;
boolean isWord;
int count;
TrieNode() {
this.children = new TrieNode[26];
this.isWord = false;
this.count = 0;
}
}
public List<Integer> findNumOfValidWords(String[] words, String[] puzzles) {
TrieNode root = new TrieNode();
buildTrie(root, words);
int len = puzzles.length;
List<Integer> res = new ArrayList<>();
// search puzzle
for (int i = 0; i < len; i++) {
char[] pz = puzzles[i].toCharArray();
char key = pz[0];
Arrays.sort(pz);
//System.out.println(Arrays.toString(pz));
res.add(match(root, pz, key, 0, false));
}
return res;
}
// Build trie from given wordlist
private void buildTrie(TrieNode root, String[] wordlist) {
for (String word : wordlist) {
TrieNode cur = root;
word = simplify(word);
//System.out.println(word);
for (char c : word.toCharArray()) {
if (cur.children[c - 'a'] == null) {
cur.children[c - 'a'] = new TrieNode();
}
cur = cur.children[c - 'a'];
}
cur.isWord = true;
cur.count += 1;
}
}
private int match(TrieNode cur, char[] pz, char key, int index, boolean hasKey) {
if (index == pz.length) {
if (!hasKey || !cur.isWord) {
return 0;
}
return cur.count;
}
int res = 0;
char curChar = pz[index];
if (curChar == key) {
if (cur.children[curChar - 'a'] == null) {
return 0;
} else {
hasKey = true;
res += match(cur.children[curChar - 'a'], pz, key, index + 1, hasKey);
return res;
}
} else {
if (cur.children[curChar - 'a'] != null){
// match this index
res += match(cur.children[curChar - 'a'], pz, key, index + 1, hasKey);
}
// skip this index
res += match(cur, pz, key, index + 1, hasKey);
return res;
}
}
// pre-processing to sort every char in the word of wordList and remove duplicate chars
private String simplify(String word) {
char[] sc = word.toCharArray();
Arrays.sort(sc);
StringBuilder sb = new StringBuilder();
for (int i = 0; i < sc.length; i++) {
if (i > 0 && sc[i] == sc[i - 1]) {
continue;
}
sb.append(sc[i]);
}
return sb.toString();
}
}