LeetCode_Word Ladder

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

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.
int ladderLength(string start, string end, set<string> &dict)
{
	if (start == "" || end == "")
		return 0;

	queue<string> q;
	q.push(start);
	q.push("0");
	unordered_set<string> s;
	s.insert(start);
	int ans = 0;
	int len = start.length();
	while(!q.empty())
	{
		string str = q.front();
		q.pop();
		if (str == "0")
		{	
			if (q.empty())
			{
				return 0;
			}
			++ans;
			q.push("0");
			continue;
		}
		if (str == end)
		{
			++ans;
			return ans;
		}
		bool found = false;
		for (int i = 0; i < len; ++i)
		{
			char ch = str[i];
			string newStr = str;
			for (int j = 0; j < 26; ++j)
			{
				char newCh = 'a' + j;
				if (ch != newCh)
				{
					newStr[i] = newCh;
					if (s.find(newStr) == s.end() && dict.find(newStr) != dict.end())
					{	
						s.insert(newStr);
						q.push(newStr);						
					}
				}
			}
		}		
	}
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值