Class Solution
-
- All Implemented Interfaces:
public final class Solution
126 - Word Ladder II.
Hard
A transformation sequence from word
beginWord
to wordendWord
using a dictionarywordList
is a sequence of words <code>beginWord -> s<sub>1</sub> -> s<sub>2</sub> -> ... -> s<sub>k</sub></code> such that:Every adjacent pair of words differs by a single letter.
Every <code>s<sub>i</sub></code> for
1 <= i <= k
is inwordList
. Note thatbeginWord
does not need to be inwordList
.<code>s<sub>k</sub> == endWord</code>
Given two words,
beginWord
andendWord
, and a dictionarywordList
, return all the shortest transformation sequences frombeginWord
toendWord
, or an empty list if no such sequence exists. Each sequence should be returned as a list of the words <code>beginWord, s<sub>1</sub>, s<sub>2</sub>, ..., s<sub>k</sub></code>.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"]
Explanation: There are 2 shortest transformation sequences:
"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 there is no valid transformation sequence.
Constraints:
1 <= beginWord.length <= 5
endWord.length == beginWord.length
1 <= wordList.length <= 500
wordList[i].length == beginWord.length
beginWord
,endWord
, andwordList[i]
consist of lowercase English letters.beginWord != endWord
All the words in
wordList
are unique.The sum of all shortest transformation sequences does not exceed <code>10<sup>5</sup></code>.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-