题目
Design a data structure that supports the following two operations:
1 | void addWord(word) |
search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter.
Example:
1 | addWord("bad") |
Note:
You may assume that all words are consist of lowercase letters a-z.
思路
Trie树.
代码
1 | class Node(object): |