-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTrie.java
More file actions
73 lines (59 loc) · 1.33 KB
/
Trie.java
File metadata and controls
73 lines (59 loc) · 1.33 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
72
73
package crack.coding.interview;
import java.util.HashMap;
class TrieNode {
HashMap<Character, TrieNode> children = new HashMap<Character, TrieNode>();
boolean isLeaf = false;
}
public class Trie {
private TrieNode root;
public Trie() {
root = new TrieNode();
}
public void insert(String word) {
HashMap<Character, TrieNode> children = root.children;
for(int i = 0 ; i < word.length(); i++) {
TrieNode trieNode;
char c = word.charAt(i);
if(children.containsKey(c)) {
trieNode = children.get(c);
} else {
trieNode = new TrieNode();
children.put(c, trieNode);
}
children = trieNode.children;
if(i == word.length() -1) {
trieNode.isLeaf = true;
}
}
}
public boolean search(String word) {
TrieNode t = searchWord(word);
if( t!= null && t.isLeaf) {
return true;
} else {
return false;
}
}
public boolean searchStartsWith(String word) {
TrieNode t = searchWord(word);
if( t!= null) {
return true;
} else {
return false;
}
}
public TrieNode searchWord(String word) {
HashMap<Character, TrieNode> children = root.children;
TrieNode t = null;
for(int i = 0; i < word.length(); i++) {
char c = word.charAt(i);
if(children.containsKey(c)) {
t = children.get(c);
children = t.children;
} else {
return null;
}
}
return t;
}
}