human
Solve in Python:
Implement a magic directory with buildDict, and search methods.


For the method buildDict, you'll be given a list of non-repetitive words to build a dictionary.


For the method search, you'll be given a word, and judge whether if you modify exactly one character into another character in this word, the modified word is in the dictionary you just built.

Example 1:

Input: buildDict(["hello", "leetcode"]), Output: Null
Input: search("hello"), Output: False
Input: search("hhllo"), Output: True
Input: search("hell"), Output: False
Input: search("leetcoded"), Output: False


Note:

You may assume that all the inputs are consist of lowercase letters a-z.
For contest purpose, the test data is rather small by now. You could think about highly efficient algorithm after the contest.
Please remember to RESET your class variables declared in class MagicDictionary, as static/class variables are persisted across multiple test cases. Please see here for more details.

Can you provide a the Python program you requested?
assistant
#Here is the Python program you requested.

class MagicDictionary:
 
     def __init__(self):
         """
         Initialize your data structure here.
         """
         self.tier=[None]*27
         
 
     def buildDict(self, dict):
         """
         Build a dictionary through a list of words
         :type dict: List[str]
         :rtype: void
         """
         for word in dict:
             p=self.tier
             for c in word:
                 t=ord(c)-ord('a')
                 if not p[t]:
                     p[t]=[None]*27
                 p=p[t]
             p[26]=1
         
 
     def search(self, word):
         """
         Returns if there is any word in the trie that equals to the given word after modifying exactly one character
         :type word: str
         :rtype: bool
         """
         def func(w):
             p=self.tier
             for c in w:
                 t=ord(c)-ord('a')
                 if not p[t]:
                     return False
                 p=p[t]
             return p[26]==1
         pool='abcdefghijklmnopqrstuvwxyz'
         for i in range(len(word)):
             for cc in pool:
                 if cc!=word[i]:
                     tt=word[:i]+'%c'%cc+word[i+1:]
                     if func(tt):
                         return True
         return False
             
         
 
 
 # Your MagicDictionary object will be instantiated and called as such:
 # obj = MagicDictionary()
 # obj.buildDict(dict)
 # param_2 = obj.search(word)