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.
这是一个超经典的数据结构
class Trie {
public:
struct Node{
bool is_end;
Node* son[26];
Node(){
is_end = false;
for(int i=0;i<26;i++) son[i] = nullptr;
}
}*root;
/** Initialize your data structure here. */
Trie() {
root = new Node();
}
/** Inserts a word into the trie. */
void insert(string word) {
auto p = root;
for(auto c:word){
int i = c-'a';
if(p->son[i]==nullptr) p->son[i] = new Node();
p = p->son[i];
}
p->is_end = true;
}
/** Returns if the word is in the trie. */
bool search(string word) {
auto p = root;
for(auto c:word){
int i = c-'a';
if(p->son[i]==nullptr) return false;
p = p->son[i];
}
return p->is_end;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
auto p = root;
for(auto c:prefix){
int i = c - 'a';
if(p->son[i]==nullptr) return false;
p = p->son[i];
}
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);
*/