bfs：词语阶梯

Leetcode, WordLadder
虽然不太懂，但还是记录一下，参考soulmachine

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <unordered_set>
using namespace std;

//时间复杂度O（n）,空间复杂度O（n）
int solution(const string& start, const string &end,
	const unordered_set<string> &dict)
{
	queue<string> current, next;	//当前层
	unordered_set<string> visited;	//判重

	int level = 0;	//层次
	bool found = false;

	auto state_is_target = [&](const string &s) {return s == end; };
	//改变每个位置字符，找在字典出现的字符串
	auto state_extend = [&](const string &s) {
		vector<string> result;

		for ( size_t i = 0; i < s.size(); ++i )
		{
			string new_word(s);
			for (char c = 'a'; c <= 'z'; ++c)
			{
				if (c == new_word[i])
					continue;

				swap(c, new_word[i]);

				if ((dict.count(new_word) > 0 || new_word == end) &&
					!visited.count(new_word) )
				{
					result.push_back(new_word);
					visited.insert(new_word);
				}
				swap(c, new_word[i]);	//恢复该单词
			}
		}
		return result;
	};

	current.push(start);
	while ( !current.empty() && !found )
	{
		++level;
		while ( !current.empty() && !found )
		{
			const string str = current.front();
			current.pop();

			const auto &new_states = state_extend(str);
			for ( const auto &state : new_states )
			{
				next.push(state);
				if (state_is_target(state))
				{
					found = true;	//找到了
					break;
				}
			}
		}
		swap(next, current);
	}

	if (found) return level + 1;
	else return 0;
}


int main()
{
	string start = "hit";
	string end = "cog";
	unordered_set<string> dict = { "hot", "dot", "dog", "lot", "log" };
	cout << solution(start, end, dict) << endl;	//5

	return 0;
}