本文介绍了一种寻找两个单词间最短转换路径的算法。给定起始与目标单词及字典，算法找出所有可能的最短路径。例如从hit到cog，通过hot、dot等中间词最终达到目标词。
[Problem]
[Solution]
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.
[Solution]
wait a moment说明：版权所有，转载请注明出处。 Coder007的博客
扫一扫
2215
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
