-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathDay14-ImplementTrie.java
73 lines (64 loc) · 1.91 KB
/
Day14-ImplementTrie.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
73
class Trie {
/** Initialize your data structure here. */
boolean isEnd;
Trie[] link;
public Trie() {
isEnd=false;
link=new Trie[26];
}
/** Inserts a word into the trie. */
public void insert(String word) {
int i=0;
char[] ch=word.toCharArray();
Trie t=this;
while(t!=null && i<ch.length && t.link[ch[i]-'a']!=null){
t=t.link[ch[i]-'a'];
i++;
}
if(i==ch.length){
t.isEnd=true;
return;
}
for(;i<ch.length;i++){
Trie temp=new Trie();
t.link[ch[i]-'a']=temp;
t=temp;
}
t.isEnd=true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
int i=0;
char[] ch=word.toCharArray();
Trie t=this;
while(t!=null && i<ch.length && t.link[ch[i]-'a']!=null){
t=t.link[ch[i]-'a'];
i++;
}
if(i==ch.length && t.isEnd){
return true;
}
return false;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
int i=0;
char[] ch=prefix.toCharArray();
Trie t=this;
while(t!=null && i<ch.length && t.link[ch[i]-'a']!=null){
t=t.link[ch[i]-'a'];
i++;
}
if(i==ch.length){
return true;
}
return false;
}
}
/**
* 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);
*/