-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTrie.java
More file actions
81 lines (67 loc) · 2.13 KB
/
Trie.java
File metadata and controls
81 lines (67 loc) · 2.13 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
class Trie {
TrieNode root;
/** Initialize your data structure here. */
public Trie() {
root = new TrieNode();
}
/** Inserts a word into the trie. */
public void insert(String word) {
TrieNode node = root;
for(int i = 0; i < word.length(); i++) {
char curr = word.charAt(i);
if(!node.containsChar(curr)) {
node.put(curr, new TrieNode());
}
node = node.get(curr);
}
node.end = true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
TrieNode node = searchNode(word);
return node != null && node.end;
}
private TrieNode searchNode(String word) {
TrieNode node = root;
for(int i = 0; i < word.length(); i++) {
char curr = word.charAt(i);
if(!node.containsChar(curr)) {
return null;
}
node = node.get(curr);
}
return node;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
return searchNode(prefix) != null ;
}
private class TrieNode {
//TrieNode[] links;
Map<Character, TrieNode> links;
boolean end;
TrieNode() {
//links = new TrieNode[26];
links = new HashMap<>();
}
boolean containsChar(char curr) {
//return links[curr - 'a'] != null;
return links.containsKey(curr);
}
TrieNode get(char c) {
//return links[c - 'a'];
return links.get(c);
}
void put(char c, TrieNode n){
//links[c - 'a'] = n;
links.put(c, n);
}
}
}
/**
* 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);
*/