Trie(发音类似 "try")或者说 前缀树 是一种树形数据结构,用于高效地存储和检索字符串数据集中的键。这一数据结构有相当多的应用情景,例如自动补完和拼写检查。
请你实现 Trie 类:
Trie()
初始化前缀树对象。void insert(String word)
向前缀树中插入字符串word
。boolean search(String word)
如果字符串word
在前缀树中,返回true
(即,在检索之前已经插入);否则,返回false
。boolean startsWith(String prefix)
如果之前已经插入的字符串word
的前缀之一为prefix
,返回true
;否则,返回false
。
示例:
输入 ["Trie", "insert", "search", "search", "startsWith", "insert", "search"] [[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]] 输出 [null, null, true, false, true, null, true] 解释 Trie trie = new Trie(); trie.insert("apple"); trie.search("apple"); // 返回 True trie.search("app"); // 返回 False trie.startsWith("app"); // 返回 True trie.insert("app"); trie.search("app"); // 返回 True
提示:
1 <= word.length, prefix.length <= 2000
word
和prefix
仅由小写英文字母组成insert
、search
和startsWith
调用次数 总计 不超过3 * 104
次
class Trie {
bool isend;
Trie* childen[28];
public:
/** Initialize your data structure here. */
Trie() {
isend = false;
for(int i = 0;i < 28;i++){
childen[i] = NULL;
}
}
/** Inserts a word into the trie. */
void insert(string word) {
Trie* node = this;
for(int i = 0;i < word.size();i++){
if(node->childen[word[i] - 'a'] == NULL){
Trie* temp = new Trie();
node->childen[word[i] - 'a'] = temp;
}
node = node->childen[word[i] - 'a'];
}
node->isend = true;
}
/** Returns if the word is in the trie. */
bool search(string word) {
Trie* node = this;
for(int i = 0;i < word.size();i++){
if(node->childen[word[i] - 'a'] == NULL) return false;
node = node->childen[word[i] - 'a'];
}
return node->isend;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
Trie* node = this;
for(int i = 0;i < prefix.size();i++){
if(node->childen[prefix[i] - 'a'] == NULL) return false;
node = node->childen[prefix[i] - '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);
*/