leetcode 127. 单词接龙
给定两个单词(beginWord 和 endWord)和一个字典,找到从 beginWord 到 endWord 的最短转换序列的长度。转换需遵循如下规则:
每次转换只能改变一个字母。
转换过程中的中间单词必须是字典中的单词。
说明:
如果不存在这样的转换序列,返回 0。
所有单词具有相同的长度。
所有单词只由小写字母组成。
字典中不存在重复的单词。
你可以假设 beginWord 和 endWord 是非空的,且二者不相同。
示例 1:
输入:
beginWord = "hit",
endWord = "cog",
wordList = ["hot","dot","dog","lot","log","cog"]
输出: 5
解释: 一个最短转换序列是 "hit" -> "hot" -> "dot" -> "dog" -> "cog",
返回它的长度 5。
示例 2:
输入:
beginWord = "hit"
endWord = "cog"
wordList = ["hot","dot","dog","lot","log"]
输出: 0
解释: endWord "cog" 不在字典中,所以无法进行转换。
思路
典型bfs,直接看代码
class Solution:
def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int:
wordList = set(wordList)
if len(wordList) == 0 or endWord not in wordList:
return 0
if beginWord in wordList:
wordList.remove(beginWord)
queue = []
queue.append(beginWord)
visited = set()
visited.add(beginWord)
word_len = len(beginWord)
step = 1
while queue:
curr_size = len(queue)
for i in range(curr_size):
word = queue.pop(0)
word_list = list(word)
for j in range(word_len):
origin_char = word_list[j]
for k in range(26):
word_list[j] = chr(ord('a') + k)
next_word = ''.join(word_list)
if next_word in wordList:
if next_word == endWord:
return step + 1
if next_word not in visited:
visited.add(next_word)
queue.append(next_word)
word_list[j] = origin_char
step += 1
return 0