[leetcode]126. Word Ladder II

链接：https://leetcode.com/problems/word-ladder-ii/description/

 

Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) 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 an empty list 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:
[
  ["hit","hot","dot","dog","cog"],
  ["hit","hot","lot","log","cog"]
]

Example 2:

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

Output: []

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

 

BFS

class Solution {
public:
     vector<vector<string>> findLadders(string beginWord, string endWord, vector<string>& wordList) {
        vector<vector<string>> ans;
        unordered_set<string> dict(wordList.begin(), wordList.end());
        if(!dict.count(endWord)) return ans;
        vector<string> visited; //record visited words  
        queue<vector<string>> q; 
        q.push({beginWord});
        while(!q.empty())
        {
           //if(!ans.empty())
           //    return ans;
            
           int n = q.size();
           for(int i = 0 ; i < n; ++i)
           {
               auto cur=q.front(); q.pop();
               auto s = cur.back();
              
               for(auto& c : s)
               {
                   const char origin = c;                  
                   for(c='a'; c<='z'; ++c)
                   {  
                       if(!dict.count(s)) continue;
                       auto path = cur; 
                       path.push_back(s); 
                       visited.push_back(s); 
                       if(s==endWord) ans.push_back(path);
                       else q.push(path);
                   }
                
                   c = origin;
               }
               
           }
            
           for(auto& w : visited) dict.erase(w);//erase visited
           visited.clear();
            
        }
        return ans; 
      
    }
    
};