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.
题意:构造trie树。
注意:假设输入不为null,且都为小写字母。
class Trie {
private:
struct Node
{
vector<Node*> children;
bool isWord;
char val;
Node(char c) {
val = c;
isWord = false;
children.resize(26);
}
};
Node* trieRoot;
public:
/** Initialize your data structure here. */
Trie() {
trieRoot = new Node(' ');
}
/** Inserts a word into the trie. */
void insert(string word) {
Node* node = trieRoot;
for (int i = 0; i < word.size(); i++)
{
int index = word[i] - 'a';
if (node->children[index] == nullptr)
node->children[index] = new Node(word[i]);
node = node->children[index];
}
node->isWord = true;
}
/** Returns if the word is in the trie. */
bool search(string word) {
Node* node = trieRoot;
for (int i = 0; i < word.size(); i++)
{
int index = word[i] - 'a';
if (node->children[index] == nullptr)
return false;
node = node->children[index];
}
return node->isWord;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
bool startsWith(string prefix) {
Node* node = trieRoot;
for (int i = 0; i < prefix.size(); i++)
{
int index = prefix[i] - 'a';
if (node->children[index] == nullptr)
return false;
node = node->children[index];
}
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);
*/