leetcode Implement Trie (Prefix Tree)
阿新 • • 發佈:2019-01-09
關於字首樹的定義,資料很多,根據這些資料翻譯成對應的程式碼,下面給出AC的程式碼:
class Trie {
public:
/** Initialize your data structure here. */
Trie() {
root = new TrieNode; //初始化根節點
}
/** Inserts a word into the trie. */
void insert(string word) {
TrieNode* cur = root; //當前的節點是根節點
for(int i = 0 ; i < word.length(); ++i)
{
int k = (word[i] - 'a');
if(cur -> next[k] == NULL)
{
cur -> next[k] = new TrieNode();
}
cur = cur -> next[k];
}
cur -> exsit = true;
}
/** Returns if the word is in the trie. */
bool search(string word) {
TrieNode* cur = root;
for(int i = 0; i < word.length(); ++i)
{
int k = word[i] - 'a';
if(cur -> next[k] == NULL)
return false;
cur = cur -> next[k];
}
if(cur -> exsit)
return true;
else
return false;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
TrieNode* cur = root;
for(int i = 0; i < prefix.length(); ++i)
{
int k = prefix[i] - 'a';
if(cur -> next[k] == NULL)
return false;
cur = cur -> next[k];
}
return true;
}
struct TrieNode
{
TrieNode* next[26];
bool exsit;
TrieNode() : exsit(false)
{
memset(next, 0, sizeof(next));
}
};
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);
*/