LeetCode OJ - Word Ladder

最新推荐文章于 2019-01-08 08:29:22 发布

姥姥教我学编程

最新推荐文章于 2019-01-08 08:29:22 发布

阅读量593

点赞数

分类专栏：基础篇

本文链接：https://blog.csdn.net/afxstar/article/details/32337629

版权

基础篇专栏收录该内容

154 篇文章 0 订阅

订阅专栏

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.

分析：感觉里面有环，不过题目给了unordered_set为hash表，故hash表中元素使用后删除可以解除环。

第一眼还是DFS，使用hash表感觉时间复杂度应该还行

思路一：DFS

int ret = INT_MAX;
DFS(start, item) {
    if(start == end) {
        ret = min(ret, item.size());
        return ;
    } else {
        item += start;
    }
    for(x in dict) {
        if(x与start只相差一个字符) {
            dict.erase(x);
            DFS(x, item);
            dict.insert(x);
        }
    }
}