本文共 1056 字，大约阅读时间需要 3 分钟。

题目：（中等）

标签：哈希表、字典树

解法一（哈希表）：

class MagicDictionary:    def __init__(self):        self.pattern = {
   }    def buildDict(self, dictionary: List[str]) -> None:        for word in dictionary:            for i in range(len(word)):                if (word[:i] + "." + word[i + 1:]) not in self.pattern:                    self.pattern[(word[:i] + "." + word[i + 1:])] = word[i]                else:                    if word[i] != self.pattern[(word[:i] + "." + word[i + 1:])]:                        self.pattern[(word[:i] + "." + word[i + 1:])] = None        print(self.pattern)    def search(self, searchWord: str) -> bool:        for i in range(len(searchWord)):            if (searchWord[:i] + "." + searchWord[i + 1:]) in self.pattern:                if searchWord[i] != self.pattern[(searchWord[:i] + "." + searchWord[i + 1:])]:                    return True        return False

转载地址：https://dataartist.blog.csdn.net/article/details/109836958 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！