Word_ladder

题目链接

参考了大神的代码

#include <unordered_map>
#include <unordered_set>
class Solution {
public:
void gen_path(unordered_map<string, vector<string>>& father, vector<string>& path, string start, string word,vector<vector<string>>& ret)
{
path.push_back(word);
if (start == word)
{
ret.push_back(path);
reverse(ret.back().begin(), ret.back().end());
}
else
{
for (auto f : father[word])
{
gen_path(father, path, start, f, ret);
}
}
path.pop_back();
}
vector<vector<string>> findLadders(string start, string end, unordered_set<string> &dict) {
unordered_map<string, vector<string>> father;
unordered_set<string> current, next;//便于去重
bool found = false;
unordered_set<string> visit;
current.insert(start);
while (!current.empty()&&!found)
{
//将本层全部访问
for (auto word : current)
visit.insert(word);
for (auto word : current)
{
for (size_t l = 0; l < word.size(); l++)
{
string new_word = word;
for (char c = 'a'; c <= 'z'; c++)
{
if (c == new_word[l])
continue;
swap(c,new_word[l]);
if (new_word == end)
found = true;//找到哦
if (visit.count(new_word) == 0 && (dict.count(new_word)>0) || new_word == end)
{
next.insert(new_word);
father[new_word].push_back(word);
}
swap(c, new_word[l]);//restore
}
}
}
current.clear();
swap(current, next);
}
vector<vector<string>> ret;
if (found)
{
vector<string> path;
gen_path(father, path, start, end, ret);
}
return ret;
}
};