Class Solution
-
- All Implemented Interfaces:
public final class Solution
127 - Word Ladder.
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 the number of words in the shortest transformation sequence frombeginWord
toendWord
, or0
if no such sequence exists.Example 1:
Input: beginWord = "hit", endWord = "cog", wordList = "hot","dot","dog","lot","log","cog"
Output: 5
Explanation: One shortest transformation sequence is "hit" -> "hot" -> "dot" -> "dog" -> cog", which is 5 words long.
Example 2:
Input: beginWord = "hit", endWord = "cog", wordList = "hot","dot","dog","lot","log"
Output: 0
Explanation: The endWord "cog" is not in wordList, therefore there is no valid transformation sequence.
Constraints:
1 <= beginWord.length <= 10
endWord.length == beginWord.length
1 <= wordList.length <= 5000
wordList[i].length == beginWord.length
beginWord
,endWord
, andwordList[i]
consist of lowercase English letters.beginWord != endWord
All the words in
wordList
are unique.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-