forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStream of Characters.java
More file actions
65 lines (56 loc) · 1.6 KB
/
Stream of Characters.java
File metadata and controls
65 lines (56 loc) · 1.6 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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
class StreamChecker {
String[] words;
TrieNode root;
StringBuilder sb = new StringBuilder();
public StreamChecker(String[] words) {
this.words = words;
root = new TrieNode('#');
treeify(words);
}
private void treeify (String[] words) {
for (String word : words) {
TrieNode curr = root;
for (int i = word.length() - 1; i >= 0; i--) {
char c = word.charAt(i);
if (curr.childrens[c - 'a'] == null) {
curr.childrens[c - 'a'] = new TrieNode(c);
}
curr = curr.childrens[c - 'a'];
if (i == 0) {
curr.isWord = true;
}
}
}
}
public boolean query(char letter) {
sb.append(letter);
TrieNode curr = root;
for (int i = sb.length() - 1; i >= 0; i--) {
if (curr.childrens[sb.charAt(i) - 'a'] != null) {
curr = curr.childrens[sb.charAt(i) - 'a'];
}
else {
break;
}
if (curr.isWord) {
return true;
}
}
return false;
}
class TrieNode {
char key;
TrieNode[] childrens;
boolean isWord;
public TrieNode (char key) {
this.key = key;
this.childrens = new TrieNode[26];
isWord = false;
}
}
}
/**
* Your StreamChecker object will be instantiated and called as such:
* StreamChecker obj = new StreamChecker(words);
* boolean param_1 = obj.query(letter);
*/