思路比较简单,直接上代码了:
class Trie {
Trie *child[26]; //记录后续字母
bool isWord; //截止到当前的字符是否是一个单词
public:
/** Initialize your data structure here. */
Trie() {
isWord = false;
for(int i = 0; i < 26; i++) {
child[i] = nullptr;
}
}
/** Inserts a word into the trie. */
void insert(string word) {
Trie *t = this;
for(char c : word) {
if(!t->child[c-'a']) {
t->child[c-'a'] = new Trie();
}
t = t->child[c-'a'];
}
t->isWord = true;
}
/** Returns if the word is in the trie. */
bool search(string word) {
Trie *t = this;
for(char c : word) {
if(!t -> child[c - 'a']) {
return false;
}
t = t->child[c - 'a'];
}
return t->isWord;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
Trie *t = this;
for(char c : prefix) {
if(!t->child[c-'a']) {
return false;
}
t = t->child[c - 'a'];
}
return true;
}
};
/**
* Your Trie object will be instantiated and called as such:
* Trie* obj = new Trie();
* obj->insert(word);
* bool param_2 = obj->search(word);
* bool param_3 = obj->startsWith(prefix);
*/