https://leetcode-cn.com/problems/implement-trie-prefix-tree/
题目
实现一个 Trie (前缀树),包含 insert, search, 和 startsWith 这三个操作。
示例
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
说明
- 你可以假设所有的输入都是由小写字母 a-z 构成的。
- 保证所有输入均为非空字符串。
代码
class Trie {
private:
bool isEnd;
Trie *next[26];
public:
/** Initialize your data structure here. */
Trie() {
isEnd = false;
memset(next, 0, sizeof(next));
}
/** Inserts a word into the trie. */
void insert(string word) {
Trie *node = this;
for (int i = 0; i < word.length(); i++) {
if (node -> next[word[i] - 'a'] == NULL) {
node -> next[word[i] - 'a'] = new Trie();
}
node = node -> next[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.length(); i++) {
node = node -> next[word[i] - 'a'];
if (!node) return false;
}
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.length(); i++) {
node = node -> next[prefix[i] - 'a'];
if (!node) return false;
}
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);
*/