Design a data structure that supports adding new words and finding if a string matches any previously added string.
Implement the WordDictionary class:
WordDictionary() Initializes the object.
void addWord(word) Adds word to the data structure, it can be matched later.
bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter.
class WordDictionary {
vector<WordDictionary*> children;
bool isEndOfWord;
public:
WordDictionary(): isEndOfWord(false){
children = vector<WordDictionary*>(26, nullptr);
}
void addWord(string word) {
WordDictionary *curr = this;
for(char c: word){
if(curr->children[c - 'a'] == nullptr)
curr->children[c - 'a'] = new WordDictionary();
curr = curr->children[c - 'a'];
}
curr->isEndOfWord = true;
}
bool search(string word) {
WordDictionary *curr = this;
for(int i = 0; i < word.length(); ++i){
char c = word[i];
if(c == '.'){
for(auto ch: curr->children)
if(ch && ch->search(word.substr(i+1))) return true;
return false;
}
if(curr->children[c - 'a'] == nullptr) return false;
curr = curr->children[c - 'a'];
}
return curr && curr->isEndOfWord;
}
};
