https://leetcode-cn.com/problems/QC3q1f/
class Trie {
Trie[] child;
boolean isEnd;
/** Initialize your data structure here. */
public Trie() {
child=new Trie[26];
isEnd=false;
}
/** Inserts a word into the trie. */
public void insert(String word) {
Trie node=this;
for(int i=0;i<word.length();i++){
int k=word.charAt(i)-'a';
if(node.child[k]==null){
node.child[k]=new Trie();
}
node=node.child[k];
}
node.isEnd=true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
Trie node=this;
for(int i=0;i<word.length();i++){
int k=word.charAt(i)-'a';
if(node.child[k]==null){
return false;
}
node=node.child[k];
}
return node.isEnd==true;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
Trie node=this;
for(int i=0;i<prefix.length();i++){
int k=prefix.charAt(i)-'a';
if(node.child[k]==null){
return false;
}
node=node.child[k];
}
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);
*/