- Implement a trie with
insert
,search
, andstartsWith
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 TrieNode {
public:
TrieNode *child[26];//每个结点都有一个大小为26的指针数组
bool isWord;//标识符,判断到当前结点是否为单词
TrieNode() : isWord(false){
for (auto &a : child) a = NULL;
}
};
class Trie {
public:
/** Initialize your data structure here. */
Trie() {
root = new TrieNode();
}
/** Inserts a word into the trie. */
void insert(string word) {
TrieNode *p = root;
for (auto &a : word)
{
int i = a - 'a';
if (!p->child[i])
p->child[i] = new TrieNode();
p = p->child[i];
}
p->isWord = true;
}
/** Returns if the word is in the trie. */
bool search(string word) {
TrieNode *p = root;
for (auto &a : word) {
int i = a - 'a';
if (!p->child[i])
return false;
p = p->child[i];
}
return p->isWord;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
TrieNode *p = root;
for (auto &a : prefix) {
int i = a - 'a';
if (!p->child[i])
return false;
p = p->child[i];
}
return true;
}
//以下为字典树的析构,在leetcode中可以省略
/*void Delete(TrieNode *p)
{
for(int i=0;i<26;i++)
{
if(p->child[i] != NULL)
Delete(p->child[i]);
}
delete p;
}
~Trie()
{
if(root != NULL)
Delete(root);
}*/
private:
TrieNode* root;
};
/**
* 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);
*/