-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathAddAndSearchWordDataStructureDesign.java
More file actions
71 lines (61 loc) · 2.03 KB
/
AddAndSearchWordDataStructureDesign.java
File metadata and controls
71 lines (61 loc) · 2.03 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
66
67
68
69
70
71
class TrieNode {
private char val;
public Map<Character, TrieNode> dict;
public boolean isLeaf;
public TrieNode(char val) {
this.val = val;
dict = new HashMap<Character, TrieNode>();
isLeaf = false;
}
}
public class WordDictionary {
private TrieNode root;
public WordDictionary() {
root = new TrieNode('\0');
}
// Adds a word into the data structure.
public void addWord(String word) {
TrieNode curr = root;
for (int i = 0; i < word.length(); i++) {
char currChar = word.charAt(i);
if (curr.dict.containsKey(currChar) == false) {
TrieNode next = new TrieNode(currChar);
curr.dict.put(currChar, next);
curr = next;
} else {
TrieNode next = curr.dict.get(currChar);
curr = next;
}
if (i == word.length() - 1) {
curr.isLeaf = true;
}
}
}
// 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 searchTrie(root, word);
}
public boolean searchTrie(TrieNode root, String word) {
if (word.length() == 0) {
return root.isLeaf;
}
for (int i = 0; i < word.length(); i++) {
char currChar = word.charAt(i);
if (currChar != '.') {
if (root.dict.containsKey(currChar) == false) {
return false;
} else {
return searchTrie(root.dict.get(currChar), word.substring(i+1, word.length()));
}
} else {
boolean result = false;
for (Map.Entry<Character, TrieNode> entry : root.dict.entrySet()) {
result |= searchTrie(entry.getValue(), word.substring(i+1, word.length()));
}
return result;
}
}
return false;
}
}