-
Notifications
You must be signed in to change notification settings - Fork 0
/
ImplementTrie.java
48 lines (43 loc) · 1.23 KB
/
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
public class Trie {
Trie[] t;
boolean end;
static Trie trie = new Trie();
//Initialize your data structure here
Trie() {
t = new Trie[26];
end = false;
}
//Inserts a word into the trie
public static void insert(String word) {
Trie root = trie;
for(char c : word.toCharArray()){
if(root.t[c-'a']==null){
root.t[c-'a'] = new Trie();
}
root = root.t[c-'a'];
}
root.end = true;
}
//Returns if the word is in the trie
public static boolean search(String word) {
Trie root = trie;
for(char c : word.toCharArray()){
if(root.t[c-'a']==null)
return false;
root = root.t[c-'a'];
}
if(root.end==true)
return true;
return false;
}
//Returns if there is any word in the trie that starts with the given prefix
public static boolean startsWith(String prefix) {
Trie root = trie;
for(char c : prefix.toCharArray()){
if(root.t[c-'a']==null)
return false;
root = root.t[c-'a'];
}
return true;
}
}