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.
解题思路:
如果只是字符串查找,采用find函数即可解决问题,但是题目需要字符串前缀匹配,这就需要使用字典树查找算法了,
链接:字典树原理
class TrieNode
{
public:
TrieNode *next[26];
bool is_word;
// 初始化字典节点
TrieNode(bool b = false)
{
memset(next, 0, sizeof(next));
is_word = b;
}
};
class Trie
{
TrieNode *root;
public:
Trie()
{
root = new TrieNode();
}
// 插入字典节点
void insert(string s)
{
TrieNode *p = root;
for(int i = 0; i < s.size(); ++ i)
{
if(p -> next[s[i] - 'a'] == NULL)
p -> next[s[i] - 'a'] = new TrieNode();
p = p -> next[s[i] - 'a'];
}
p -> is_word = true;
}
// 返回字典查找结果
bool search(string key)
{
TrieNode *p = find(key);
return p != NULL && p -> is_word;
}
// 返回字符串前缀匹配结果
bool startsWith(string prefix)
{
return find(prefix) != NULL;
}
private:
TrieNode* find(string key)
{
TrieNode *p = root;
for(int i = 0; i < key.size() && p != NULL; ++ i)
p = p -> next[key[i] - 'a'];
return p;
}
};