LeetCode Word Ladder

题目

Given two words (beginWord and endWord), and a dictionary, find the length of shortest transformation sequence from beginWord to endWord, 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"]

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.

查找最短的修改路径长度，使得单词变为目标单词。

bfs，将单词的各个位依次修改为[a~z]，查找是否有匹配项。

代码：

class Solution {
	struct str_deep		//字符和深度
	{
		string str;	//字符
		int deep;	//深度
		str_deep(string s="",int d=0):str(s),deep(d){}
	};
public:
    int ladderLength(string start, string end, unordered_set<string> &dict) {
		if(start.size()!=end.size()||start==end)
			return 0;
		str_deep strd;	//临时信息
		deque<str_deep> queue(1,str_deep(start,1));	//队列
		dict.erase(start);
		while(!queue.empty())	//bfs
		{
			strd=queue.front();
			queue.pop_front();
			for(int i=0;i<strd.str.size();i++)	//依次更改各个位，寻找相应的词
			{
				string temps=strd.str;
				for(char j='a';j<='z';j++)	//更改为相应字符
				{
					if(j==strd.str[i])
						continue;
					temps[i]=j;
					if(temps==end)	//是否完成
						return strd.deep+1;
					if(dict.find(temps)!=dict.end())	//是否可以找到
					{
						queue.push_back(str_deep(temps,strd.deep+1));
						dict.erase(temps);
					}
				}
			}
		}
		return 0;
    }
};

不知道为什么运行速度很慢，看分布应该存在更快的方法，不过没能找到……

希望高手指点。