【leetcode】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 intermediate word must exist in the word list

For example,

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

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.

思路：

BFS

代码

class Solution {
public:
    int ladderLength(string beginWord, string endWord, unordered_set<string>& wordList) {
    unordered_set<string>visited;
    queue<string> q,next;
    q.push(beginWord);
    int length=0;
    while(!q.empty())
    {
        length++;
        while(!q.empty())
        {
            string word=q.front();
            q.pop();
            //extend node
            for(int i=0; i<word.size(); i++)
            {
                for(char c='a'; c<='z'; c++)
                {
                    swap(word[i],c);
                    if(word==endWord)return length+1;
                    if(wordList.count(word)>0&&!visited.count(word))
                    {
                        
                        next.push(word);
                        visited.insert(word);
                    }
                    swap(word[i],c);
                }
            }
        }
        swap(q,next);
    }

    return 0;
        
    }
};