设计一个支持以下两种操作的数据结构:
void addWord(word)
bool search(word)
search(word) 可以搜索文字或正则表达式字符串,字符串只包含字母 . 或 a-z 。 . 可以表示任何一个字母。
示例:
addWord("bad")
addWord("dad")
addWord("mad")
search("pad") -> false
search("bad") -> true
search(".ad") -> true
search("b..") -> true
说明:
你可以假设所有单词都是由小写字母 a-z 组成的。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/add-and-search-word-data-structure-design
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路:
类似LeetCode-Python-208. 实现 Trie (前缀树),用字典树实现。
注意要用递归处理通配符.的特殊情况。
class WordDictionary(object):
def __init__(self):
"""
Initialize your data structure here.
"""
self.roots = {}
def addWord(self, word):
"""
Adds a word into the data structure.
:type word: str
:rtype: None
"""
print word
node = self.roots
for char in word:
node = node.setdefault(char, {})
node["end"] = True
def search(self, word):
"""
Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter.
:type word: str
:rtype: bool
"""
self.res = False
self.searchHelper(self.roots, word)
return self.res
def searchHelper(self, dic, word):
if not word:
self.res |= "end" in dic
return
node = dic
i, char = 0, word[0]
if char == ".":#全匹配
for x in "abcedfghijklmnopqrstuvwxyz":
if x in node:
self.searchHelper(node[x], word[1:])
elif char in node:
self.searchHelper(node[char], word[1:])
# Your WordDictionary object will be instantiated and called as such:
# obj = WordDictionary()
# obj.addWord(word)
# param_2 = obj.search(word)