-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTrie.java
More file actions
82 lines (74 loc) · 2.08 KB
/
Trie.java
File metadata and controls
82 lines (74 loc) · 2.08 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
74
75
76
77
78
79
80
81
82
package Interview;
public class Trie {
class TrieNode{
public char c;
public boolean isWord;
public TrieNode[] children = new TrieNode[26];
public TrieNode(char c){
this.c = c;
}
public TrieNode(){
}
}
private TrieNode root;
/** Initialize your data structure here. */
public Trie() {
root = new TrieNode();
root.c = ' ';
}
/** Inserts a word into the trie. */
public void insert(String word) {
char[] chars = word.toCharArray();
if(chars.length<=0){
return;
}
TrieNode tmp = root;
for(int i=0; i<chars.length; i++){
char c = chars[i];
if(tmp.children[c-'a']==null){
tmp.children[c-'a'] = new TrieNode(c);
}
tmp = tmp.children[c-'a'];
}
tmp.isWord = true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
char[] chars = word.toCharArray();
if(chars.length<=0){
return true;
}
TrieNode tmp = root;
for(int i=0; i<chars.length; i++){
char c = chars[i];
if(tmp.children[c-'a']==null){
return false;
}
tmp = tmp.children[c-'a'];
}
return tmp.isWord;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
char[] chars = prefix.toCharArray();
if(chars.length<=0){
return true;
}
TrieNode tmp = root;
for(int i=0; i<chars.length; i++){
char c = chars[i];
if(tmp.children[c-'a']==null){
return false;
}
tmp = tmp.children[c-'a'];
}
return true;
}
}
/**
* 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);
*/