leetcode-127-Word Ladder

最新推荐文章于 2024-04-20 12:03:31 发布

zem_nezer

最新推荐文章于 2024-04-20 12:03:31 发布

阅读量213

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/zem_nezer/article/details/85276546

算法专栏收录该内容

185 篇文章

订阅专栏

本文探讨了一种基于字典的字符串匹配算法的时间复杂度。作者最初考虑为每个单词创建一个图，但发现使用字典直接查找的方法更优，时间复杂度为O(n*26^i)。此外，文章提到了使用映射记录之前更改位置的重要性，以便在必要时回溯。

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

A good problem for me to analysis the time complexity. At first I want to create a graph for each word, I mean check each word is a available for the other. However, when I look up the solution I think the time complexity is O(n^2) to create the graph. Then I use the solution which they provide: for each position, try character from ‘a’ to ‘z’ literately, then see if current string is in the dictionary or not. So that the time complexity is O(n * 26^i)

Also, need to mention that we should use a map to know previous change position, so that it will go back.

Error:
N/A