-
Notifications
You must be signed in to change notification settings - Fork 1
/
Add_211.java
72 lines (59 loc) · 1.85 KB
/
Add_211.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
public class Add_211 {
// Refer to Implement_208
class TrieNode {
private final int R = 26;
private TrieNode[] links;
boolean isEnd;
public TrieNode() {
links = new TrieNode[R];
isEnd = false;
}
public boolean containsKey(char ch) {
return links[ch - 'a'] != null;
}
public TrieNode get(char ch) {
return links[ch - 'a'];
}
public void put(char ch, TrieNode node) {
links[ch - 'a'] = node;
}
public void setEnd() {
isEnd = true;
}
public boolean isEnd() {
return isEnd;
}
}
private TrieNode root;
/** Initialize your data structure here. */
public Add_211() {
root = new TrieNode();
}
/** Adds a word into the data structure. */
public void addWord(String word) {
TrieNode node = root;
for (int i = 0; i < word.length(); i++) {
char ch = word.charAt(i);
if (!node.containsKey(ch)) node.put(ch, new TrieNode());
node = node.get(ch);
}
node.setEnd();
}
/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
public boolean search(String word) {
return search(word, 0, root);
}
private boolean search(String word, int idx, TrieNode node) {
if (idx == word.length()) return node.isEnd();
char ch = word.charAt(idx);
if (ch == '.') {
for (int j = 0; j < node.links.length; j++) {
if (node.links[j] != null && search(word, idx+1, node.links[j]))
return true;
}
}
else
return node.containsKey(ch) && search(word, idx+1, node.get(ch));
return false;
}
}