LeetCode: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:

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

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.

Example 1:

Input:
beginWord = "hit",
endWord = "cog",
wordList = ["hot","dot","dog","lot","log","cog"]

Output: 5

Explanation: As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",
return its length 5.

Example 2:

Input:
beginWord = "hit"
endWord = "cog"
wordList = ["hot","dot","dog","lot","log"]

Output: 0

Explanation: The endWord "cog" is not in wordList, therefore no possible transformation.

class Solution {
public:
    int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
        if(wordList.size() <= 0 ) return 0;
        unordered_set<string> wordSet(wordList.begin(), wordList.end());
        unordered_map<string, int> map;
        queue<string>qu;
        qu.push(beginWord);
        map[beginWord] = 1;
        while(!qu.empty())
        {
            string cur = qu.front();
            qu.pop();
            
            for(int i = 0; i< cur.size(); i ++)
            {
                string newWord = cur;
                for(char ch = 'a'; ch < 'z'; ch++)
                {
                    newWord[i] = ch;
                    
                    if(wordSet.count(newWord) && newWord == endWord)
                        return map[cur] + 1;
                    
                    if(wordSet.count(newWord) && !map.count(newWord))
                    {
                        map[newWord] = map[cur] + 1;
                        qu.push(newWord);
                    }
                }
            }
        }
     return 0;   
    }
};

转自：https://www.cnblogs.com/grandyang/p/4539768.html