Word Ladder

最新推荐文章于 2024-09-08 21:02:59 发布

原创最新推荐文章于 2024-09-08 21:02:59 发布 · 241 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

149 篇文章

订阅专栏

本文探讨了从一个单词通过字母逐位替换变为另一个单词的问题，并提供了一种解决方案。具体来说，从初始单词开始，每次只改变一个字母，且每一步得到的新单词都必须在给定的字典中出现。目标是最短地完成从起始单词到目标单词的转变。

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

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence
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”]
As one shortest transformation is ”hit” -> ”hot” -> ”dot” -> ”dog” -> ”cog”, return its length 5.
Note:
• Return 0 if there is no such transformation sequence.
• All words have the same length.
• All words contain only lowercase alphabetic characters.