Word Ladder II

饭没了吃

于 2015-09-12 17:21:20 发布

阅读量219

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/u014734779/article/details/48395675

leetcode 专栏收录该内容

149 篇文章

订阅专栏

本文介绍了一种算法，该算法能够找到两个单词之间的最短转换序列，每次只改变一个字母，并确保每一步骤中的单词都在给定的词典中。例如，从'hit'到'cog'的转换路径可能包括['hit','hot','dot','dog','cog']或['hit','hot','lot','log','cog']等。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start
to end, such that:
• Only one letter can be changed at a time
• Each intermediate word must exist in the dictionary
For example, Given:
start = “hit”
end = “cog”
dict = [“hot”,”dot”,”dog”,”lot”,”log”]
Return
[
[“hit”,”hot”,”dot”,”dog”,”cog”],
[“hit”,”hot”,”lot”,”log”,”cog”]
]
Note:
• All words have the same length.
• All words contain only lowercase alphabetic characters.