class Trie {
Trie[] childNodes = new Trie[27];
/** Initialize your data structure here. */
public Trie() {
}
/** Inserts a word into the trie. */
public void insert(String word) {
Trie cur = this;
for(int i=0;i<word.length();i++){
char tmp = word.charAt(i);
if(cur.childNodes[tmp-'a'] == null){
cur.childNodes[tmp-'a'] = new Trie();//这里千万不要漏掉cur,不然每次循环默认访问this.childNodes,可能为空会引发空指针异常
}else{
}
cur = cur.childNodes[tmp-'a'];
}
cur.childNodes[26] = new Trie();//添加结束符
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
Trie cur = this;
for(int i=0;i<word.length();i++){
char tmp = word.charAt(i);
if(cur.childNodes[tmp-'a'] == null){
return false;
}
cur = cur.childNodes[tmp-'a'];
}
return cur.childNodes[26] != null? true:false;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
Trie cur = this;
for(int i=0;i<prefix.length();i++){
char tmp = prefix.charAt(i);
if(cur.childNodes[tmp-'a'] == null){
return false;
}
cur = cur.childNodes[tmp-'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);
*/
leetcode208字典树
最新推荐文章于 2023-02-07 09:58:06 发布