Design Add and Search Words Data Structure

Hard~30 min

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.
  • addWord(word) Adds word to the data structure, it can be matched later.
  • 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.

Examples

Example 1
Input: ["WordDictionary","addWord","addWord","addWord","search","search","search","search"] [[], ["bad"], ["dad"], ["mad"], ["pad"], ["bad"], [".ad"], ["b.."]]
Output: [null, null, null, null, false, true, true, true]
Explanation: WordDictionary wd = new WordDictionary(); wd.addWord("bad"); wd.addWord("dad"); wd.addWord("mad"); wd.search("pad"); // return false (not added) wd.search("bad"); // return true wd.search(".ad"); // return true (matches "bad", "dad", "mad") wd.search("b.."); // return true (matches "bad")

Constraints

  • 1 <= word.length <= 25
  • word in addWord consists of lowercase English letters
  • word in search consists of '.' or lowercase English letters
  • There will be at most 3 dots in word for search queries
  • At most 10^4 calls will be made to addWord and search
  • Expected time complexity: O(m) per operation
Code
Ctrl+EnterRun|Ctrl+⇧+EnterSubmit
Output

Run your code to see results

Use Cmd+Enter to run