127. Word Ladder(M)

127. Word Ladder
Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that:

Only one letter can be changed at a time.
Each transformed word must exist in the word list. Note that beginWord is not a transformed word.
For example,

Given:
beginWord = "hit"
endWord = "cog"
wordList = ["hot","dot","dog","lot","log","cog"]
As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",
return its length 5.

Note:
Return 0 if there is no such transformation sequence.
All words have the same length.
All words contain only lowercase alphabetic characters.
You may assume no duplicates in the word list.
You may assume beginWord and endWord are non-empty and are not the same.
UPDATE (2017/1/20):
The wordList parameter had been changed to a list of strings (instead of a set of strings). Please reload the code definition to get the latest changes.

• Difficulty:Medium
• Total Accepted:129.6K
• Total Submissions:667.5K
• Contributor:LeetCode

class Solution {
public:
    bool cmpwrd(string str1, string str2)
    {
        size_t strlen = str1.size();
        int cnt = 0;
        for (int i = 0; i < strlen; ++i)
        {
            if(str1[i] == str2[i]) ++cnt;
        }
        if(cnt == (strlen - 1)) return true;
        return false;
    }

    int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
        if(find(wordList.begin(), wordList.end(), endWord) == wordList.end()) return 0;
        size_t wLlen = wordList.size();
        vector<bool> visited(wLlen, false);
        int sum = 1;
        queue<string> qs;
        qs.push(beginWord);
        qs.push("#"); // level flag

        while (!qs.empty())
        {
            string tmpstr = qs.front();
            qs.pop();
            if(tmpstr == "#")
            {
                if(!qs.empty())
                {
                    qs.push(tmpstr);
                    tmpstr = qs.front();
                    qs.pop();
                    ++sum;
                }
                else return 0;
            }

            if(tmpstr == endWord) return sum;

            //seek for all the possible next node
            for (int j = 0; j < wLlen; ++j)
            {
                if(!visited[j] && cmpwrd(tmpstr, wordList[j]))
                {
                    if(tmpstr == endWord)
                    {
                        //cout << wordList[j] << "
" << endWord << endl;
                        return (++sum);
                    }
                    //cout << wordList[j] << " ";
                    visited[j] = true;
                    qs.push(wordList[j]);
                }
            }
            //cout << endl;
        }
        return sum;
    }
};

12.21%  Runtime: 806 ms 39 / 39 test cases passed

class Solution {  //by kaishen2
public:
    int ladderLength(string beginWord, string endWord, vector<string>& wordDict) {
        unordered_set<string> word_dict_;
        for (auto &word : wordDict) word_dict_.insert(word);
        if (word_dict_.find(endWord) == word_dict_.end()) return 0;
        else word_dict_.erase(endWord);
        unordered_set<string> q1, q2, temp;
        q1.insert(beginWord);
        q2.insert(endWord);
        int count = 0;
        while (!q1.empty() && !q2.empty()) {
            ++count;
            if (q1.size() > q2.size()) swap(q1, q2);
            temp.clear();
            for (auto word_ : q1) {
                for (int j = 0; j < word_.size(); ++j) {
                    char hold = word_[j];
                    for (char i = 'a'; i <= 'z'; ++i) {
                        word_[j] = i;
                        if (q2.find(word_) != q2.end())  return count + 1;
                        if (word_dict_.find(word_) != word_dict_.end()) {
                            word_dict_.erase(word_);
                            temp.insert(word_);
                        }
                    }
                    word_[j] = hold;
                }
            }
            swap(q1, temp);
        }
        return 0;
    }
};

93.07% 35ms