# LeetCode 208 Implement Trie (Prefix Tree)

184人阅读 评论(0)

Implement a trie with insert, search, and startsWith methods.

Note:
You may assume that all inputs are consist of lowercase letters a-z.

class TrieNode {
public:
// Initialize your data structure here.
TrieNode() {
for(int i = 0; i < 26; i++)
children[i] = NULL;
contain_self = false;
}
TrieNode *children[26];
bool contain_self;
};

class Trie {
public:
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 curidx = word[i] - 'a';
if(cur->children[curidx] == NULL)
{
cur->children[curidx] = new TrieNode();
}
cur = cur->children[curidx];
}
cur->contain_self = 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 curidx = word[i] - 'a';
if(cur->children[curidx] == NULL)
return false;
else
cur = cur->children[curidx];
}
return cur->contain_self;
}

// 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 curidx = prefix[i] - 'a';
if(cur->children[curidx] == NULL)
return false;
else
cur = cur->children[curidx];
}
return true;
}

private:
TrieNode* root;
};

// Your Trie object will be instantiated and called as such:
// Trie trie;
// trie.insert("somestring");
// trie.search("key");
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：15429次
• 积分：327
• 等级：
• 排名：千里之外
• 原创：19篇
• 转载：2篇
• 译文：0篇
• 评论：1条
文章分类
阅读排行
最新评论