Hash Table -- Leetcode problem676. Implement Magic Dictionary

• 描述：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:
1.You may assume that all the inputs are consist of lowercase letters a-z.
2.For contest purpose, the test data is rather small by now. You could think about highly efficient algorithm after the contest.
3.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.

• 分析：这道题要求实现对几个字符串的存储，和查询。查询的要求是找到有一个元素和存入字符串不同的字符串，如果存在，输出true，不存在输出false。
• 思路一：用unordered_map来实现，以要存储的字符串和把这个字符串拆分为char的值构成一个形如unordered_map<string, vector<char>>类型的unordered_map。（3ms）

class MagicDictionary {
public:
    /** Initialize your data structure here. */
    MagicDictionary() {
    }

    /** Build a dictionary through a list of words */
    void buildDict(vector<string> dict) {
        for (int i = 0; i < dict.size(); i++) {
            my_vec.clear();
            for (int j = 0; j < dict[i].size(); j++) {
                my_vec.push_back(dict[i][j]);
            }
            my_map[dict[i]] = my_vec;
        }
    }

    /** Returns if there is any word in the trie that equals to the given word after modifying exactly one character */
    bool search(string word) {
        int flag = 0;
        int length = word.length();
        unordered_map<string, vector<char>>::iterator iter;
        for (iter = my_map.begin(); iter != my_map.end(); iter++) {
            flag = 0;
            if ((iter -> second).size() == length) {
                for (int i = 0; i < length; i++) {
                    if (word[i] == (iter -> second)[i]) {
                        flag++;
                    }
                }
            }
            if (flag == length - 1) return true;
        }
        return false;
    }
private:
    unordered_map<string, vector<char>> my_map;
    vector<char> my_vec;
};

• 思路二：这种解法是在leetcode讨论区看到的，使用了unordered_set来实现，在search函数中有很大的不同。（3ms）

class MagicDictionary {
public:
    /** Initialize your data structure here. */
    MagicDictionary() {

    }

    /** Build a dictionary through a list of words */
    void buildDict(vector<string> dict) {
        for (int i = 0; i < dict.size(); i++) {
            words.insert(dict[i]);    
    }
    }

    /** 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 (int i = 0; i < word.size(); i++) {
            char wi = word[i];
            for (char ch = 'a'; ch <= 'z'; ch++) {
                if (ch == wi) continue;
                word[i] = ch;
                if (words.count(word)) return true;
            }
            word[i] = wi;
        }
        return false;
    }
private:
    unordered_set<string> words;
};

就这道题而言，使用哪种容器关系不大，关键是在这个search函数上面，对于不同种的容器有不同的search方法，这才是这道题的关键。