实现一个 Trie (前缀树),包含 insert, search, 和 startsWith 这三个操作。
示例:
Trie trie = new Trie();
trie.insert("apple");
trie.search("apple"); // 返回 true
trie.search("app"); // 返回 false
trie.startsWith("app"); // 返回 true
trie.insert("app");
trie.search("app"); // 返回 true
说明:
你可以假设所有的输入都是由小写字母 a-z 构成的。
保证所有输入均为非空字符串。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/implement-trie-prefix-tree
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class TrieNode{
public int path;
public int end;
public TrieNode[] nexts;
public TrieNode(){
this.path = 0;
this.end = 0;
this.nexts = new TrieNode[26];
}
}
class Trie {
private TrieNode root;
/** Initialize your data structure here. */
public Trie() {
this.root = new TrieNode();
}
/** Inserts a word into the trie. */
public void insert(String word) {
if(word == null){
return;
}
char[] chs = word.toCharArray();
int index = 0;
TrieNode node = root;
for(int i = 0; i < chs.length; i++){
index = chs[i] - 'a';
if(node.nexts[index] == null){
node.nexts[index] = new TrieNode();
}
node = node.nexts[index];
node.path++;
}
node.end++;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
if(word == null){
return false;
}
char[] chs = word.toCharArray();
int index = 0;
TrieNode node = root;
for(int i = 0; i <chs.length; i++){
index = chs[i] - 'a';
if(node.nexts[index] == null){
return false;
}
node = node.nexts[index];
}
if(node.end != 0){ //在这里需要判断一下,以防与前缀的startWith函数重复
return true;
}else{
return false;
}
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
if(prefix == null){
return false;
}
char[] chs = prefix.toCharArray();
int index = 0;
TrieNode node = root;
for(int i = 0; i < chs.length; i++){
index = chs[i] - 'a';
if(node.nexts[index] == null){
return false;
}
node = node.nexts[index];
}
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);
*/