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.
The code:
_note: _
in the walkthrough image below i use .a or .b or.c just to distinct the first a or b or c. This is not the same as a word starting with '.' as seen in the problem description. if we are to search a word that started with '.' ,the first letter of that word can be any letter present in the children of the root as described in the problem statement.
The Walkthrough:
for better image quality follow this link on page 3:
Top comments (0)