forked from algorithm020/algorithm020
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTrie.java
More file actions
59 lines (53 loc) · 1.46 KB
/
Trie.java
File metadata and controls
59 lines (53 loc) · 1.46 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
class Trie {
private boolean isWord;
private Trie[] next;
/** Initialize your data structure here. */
public Trie() {
isWord=false;
next=new Trie[26];
}
/** Inserts a word into the trie. */
public void insert(String word) {
Trie node=this;
char []temp=word.toCharArray();
for(char c:temp){
if(node.next[c-'a']==null){
node.next[c-'a']=new Trie();
}
node=node.next[c-'a'];
}
node.isWord=true;
return;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
Trie node=this;
char[] temp=word.toCharArray();
for(char c:temp){
if(node.next[c-'a']==null){
return false;
}
node=node.next[c-'a'];
}
return node.isWord;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
Trie node=this;
char[] temp=prefix.toCharArray();
for(char c:temp){
if(node.next[c-'a']==null){
return false;
}
node=node.next[c-'a'];
}
return node!=null;
}
}
/**
* Your Trie object will be instantiated and called as such:
* Trie obj = new Trie();
* obj.insert(word);
* boolean param_2 = obj.search(word);
* boolean param_3 = obj.startsWith(prefix);
*/