676. Implement Magic Dictionary（python+cpp）

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_21275321/article/details/84328230

题目：

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.

解释：
python代码：

class MagicDictionary(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self._dict=[]
        
    def buildDict(self, dict):
        """
        Build a dictionary through a list of words
        :type dict: List[str]
        :rtype: void
        """
        self._dict=dict
        
    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
        """
        for d in self._dict:
            if len(d)==len(word):
                _len=len(d)
                _count=0
                for i in range(_len):
                    if d[i]!=word[i]:
                        _count+=1;
                    if _count>1:
                        break
                if _count==1:
                    return True
        return False

# Your MagicDictionary object will be instantiated and called as such:
# obj = MagicDictionary()
# obj.buildDict(dict)
# param_2 = obj.search(word)

c++代码：

class MagicDictionary {
public:
    /** Initialize your data structure here. */
    vector<string> _map;
    MagicDictionary() {
        
    }
    /** Build a dictionary through a list of words */
    void buildDict(vector<string> dict) {
        _map=dict;
    }
    /** Returns if there is any word in the trie that equals to the given word after modifying exactly one character */
    bool search(string word) {
        for(auto item:_map)
        {
            if(word.size()==item.size())
            {
                int _count=0;
                for(int i=0;i<item.size();i++)
                {
                    if(item[i]!=word[i])
                        _count++;
                    if (_count>1)
                        break;
                }
                if (_count==1)
                    return true;
            }     
        }
        return false;
    }
};

/**
 * Your MagicDictionary object will be instantiated and called as such:
 * MagicDictionary obj = new MagicDictionary();
 * obj.buildDict(dict);
 * bool param_2 = obj.search(word);
 */

总结：