Word Ladder II

原创 2015年07月08日 20:54:10

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:

  1. Only one letter can be changed at a time
  2. 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:

class Solution {
public:
    vector<vector<string>> res;

    void dfsPath(unordered_map<string, unordered_set<string>> &path, vector<string> &temp, const string &key)
    {
        if(path[key].size() == 0)
        {
            temp.push_back(key);
            vector<string> tempPath = temp;
            reverse(tempPath.begin(), tempPath.end());
            res.push_back(tempPath);
            temp.pop_back();
            return ;
        }

        temp.push_back(key);
        for(unordered_set<string>::iterator iter = path[key].begin(); iter != path[key].end(); ++iter)
        {
            dfsPath(path, temp, *iter);
        }
        temp.pop_back();
    }

    vector<vector<string>> findLadders(string start, string end, unordered_set<string> &dict) {
        res.clear();
        unordered_set<string> current;
        unordered_set<string> next;
        unordered_map<string, unordered_set<string>> path;

        if(dict.count(start) > 0) dict.erase(start);
        current.insert(start);

        while(current.count(end) == 0 && !dict.empty())
        {
            for(unordered_set<string>::iterator iter = current.begin(); iter != current.end(); ++iter)
            {
                string str = *iter;
                for(int i = 0; i < str.length(); ++i)
                {
                    for(char c = 'a'; c <= 'z'; ++c)
                    {
                        string tmp = str;
                        if(tmp[i] == c) continue;
                        tmp[i] = c;
                        if(dict.count(tmp) > 0)
                        {
                            path[tmp].insert(str);
                            next.insert(tmp);
                        }
                    }
                }
            }

            if(next.empty()) break;
            for(unordered_set<string>::iterator iter = next.begin(); iter != next.end(); ++iter)
            {
                dict.erase(*iter);
            }

            current = next;
            next.clear();
        }

        vector<string> temp;
        if(current.count(end) > 0) dfsPath(path, temp, end);

        return res;
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

[LeetCode]Word Ladder II

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from...

Leetcode: Word Ladder II

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from...

LeetCode :Word Ladder II My Solution

Word Ladder II  Total Accepted: 11755 Total Submissions: 102776My Submissions Given two ...

126. Word Ladder I & II

一、题目简述给定两个单词(beginWord和endWord),和一个单词字典,找到所有从beginWord到endWord的最短转换,使得: 每次只能改变一个字母; 每个转换单词都必须在单词字典中,...

leetcode-Word Ladder II

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from...

【广度优先遍历】Word Ladder II

题目:leetcode Word Ladder II   Given two words (start and end), and a dictionary, find al...

Word Ladder II

Word Ladder II  Total Accepted: 1864 Total Submissions: 22064My Submissions   Given t...

[Leetcode 126 & 127, hard & medium] Word Ladder II & I

[Leetcode 126 & 127, hard & medium] Word Ladder II & I

Word Ladder II

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from...

leetcode: Word Ladder II

leetcode: Word Ladder II
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)