LeetCode 676 实现一个魔法字典[枚举] HERODING的LeetCode之路

Posted 2022-07-13 HERODING23

解题思路：
将单词列表记录下来，在search阶段，枚举每个单词进行比较，如果有长度相同且不同的字母只有1，返回true，否则返回false
，代码如下：

class MagicDictionary 
private:
    vector<string> words;
public:
    MagicDictionary() 

    
    
    void buildDict(vector<string> dictionary) 
        words = dictionary;
    
    
    bool search(string searchWord) 
        for(auto& word : words) 
            if(word.size() != searchWord.size()) 
                continue;
            
            int diff = 0;
            for(int i = 0; i < word.size(); i ++) 
                if(searchWord[i] != word[i]) 
                    diff ++;
                
                if(diff > 1) 
                    break;
                
            
            if(diff == 1) 
                return true;
            
        
        return false;
    
;

/**
 * Your MagicDictionary object will be instantiated and called as such:
 * MagicDictionary* obj = new MagicDictionary();
 * obj->buildDict(dictionary);
 * bool param_2 = obj->search(searchWord);
 */