Class Solution

java.lang.Object
g0101_0200.s0126_word_ladder_ii.Solution

public class Solution extends Object
126 - Word Ladder II.<p>Hard</p> <p>A <strong>transformation sequence</strong> from word <code>beginWord</code> to word <code>endWord</code> using a dictionary <code>wordList</code> is a sequence of words <code>beginWord -> s<sub>1</sub> -> s<sub>2</sub> -> &hellip; -> s<sub>k</sub></code> such that:</p> <ul> <li>Every adjacent pair of words differs by a single letter.</li> <li>Every <code>s<sub>i</sub></code> for <code>1 <= i <= k</code> is in <code>wordList</code>. Note that <code>beginWord</code> does not need to be in <code>wordList</code>.</li> <li><code>s<sub>k</sub> == endWord</code></li> </ul> <p>Given two words, <code>beginWord</code> and <code>endWord</code>, and a dictionary <code>wordList</code>, return <em>all the <strong>shortest transformation sequences</strong> from</em> <code>beginWord</code> <em>to</em> <code>endWord</code><em>, or an empty list if no such sequence exists. Each sequence should be returned as a list of the words</em> <code>[beginWord, s<sub>1</sub>, s<sub>2</sub>, &hellip;, s<sub>k</sub>]</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> beginWord = &ldquo;hit&rdquo;, endWord = &ldquo;cog&rdquo;, wordList = [&ldquo;hot&rdquo;,&ldquo;dot&rdquo;,&ldquo;dog&rdquo;,&ldquo;lot&rdquo;,&ldquo;log&rdquo;,&ldquo;cog&rdquo;]</p> <p><strong>Output:</strong> [[&ldquo;hit&rdquo;,&ldquo;hot&rdquo;,&ldquo;dot&rdquo;,&ldquo;dog&rdquo;,&ldquo;cog&rdquo;],[&ldquo;hit&rdquo;,&ldquo;hot&rdquo;,&ldquo;lot&rdquo;,&ldquo;log&rdquo;,&ldquo;cog&rdquo;]]</p> <p><strong>Explanation:</strong> There are 2 shortest transformation sequences: &ldquo;hit&rdquo; -> &ldquo;hot&rdquo; -> &ldquo;dot&rdquo; -> &ldquo;dog&rdquo; -> &ldquo;cog&rdquo; &ldquo;hit&rdquo; -> &ldquo;hot&rdquo; -> &ldquo;lot&rdquo; -> &ldquo;log&rdquo; -> &ldquo;cog&rdquo;</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> beginWord = &ldquo;hit&rdquo;, endWord = &ldquo;cog&rdquo;, wordList = [&ldquo;hot&rdquo;,&ldquo;dot&rdquo;,&ldquo;dog&rdquo;,&ldquo;lot&rdquo;,&ldquo;log&rdquo;]</p> <p><strong>Output:</strong> []</p> <p><strong>Explanation:</strong> The endWord &ldquo;cog&rdquo; is not in wordList, therefore there is no valid transformation sequence.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= beginWord.length <= 5</code></li> <li><code>endWord.length == beginWord.length</code></li> <li><code>1 <= wordList.length <= 1000</code></li> <li><code>wordList[i].length == beginWord.length</code></li> <li><code>beginWord</code>, <code>endWord</code>, and <code>wordList[i]</code> consist of lowercase English letters.</li> <li><code>beginWord != endWord</code></li> <li>All the words in <code>wordList</code> are <strong>unique</strong>.</li> </ul>