leetCode 208
Implement a trie with insert, search, and startsWith methods.
Example:
Trie trie = new Trie();
trie.insert(“apple”);
trie.search(“apple”); // returns true
trie.search(“app”); // returns false
trie.startsWith(“app”); // returns true
trie.insert(“app”);
trie.search(“app”); // returns true
Note:
You may assume that all inputs are consist of lowercase letters a-z.
All inputs are guaranteed to be non-empty strings.
class Trie {
Trie[] children = new Trie[26];
// int count;
boolean flag = false;
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 ch = word.charAt(i);
if(cur.children[ch - 'a'] == null)cur.children[ch - 'a'] = new Trie();
cur = cur.children[ch - 'a'];
}
cur.flag = true;
}
/** 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 ch = word.charAt(i);
if(cur.children[ch - 'a'] == null)return false;
cur = cur.children[ch - 'a'];
}
return cur.flag;
}
/** 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 ch = prefix.charAt(i);
if(cur.children[ch - 'a'] == null)return false;
cur = cur.children[ch - 'a'];
}
return true;
}
}