从'beginWord'到'endWord'的最短转换序列，每次只改变一个字母，并确保每个中间单词都在字典wordList中。例如，从'hit'到'hunt'的最短转换是'hit->hit->hut->hunt'，返回长度为4。如果不存在这样的转换序列，则返回0。所有单词长度相等，仅包含小写字母，并且字典中无重复单词。
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:
- Only one letter can be changed at a time.
- Each transformed word must exist in the word list. Note that beginWord is not a transformed word.
For example,
Given:
beginWord = "hit"
endWord =
最低0.47元/天 解锁文章
扫一扫
543
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
