174人阅读 评论(0)

Given two words (beginWord and endWord), and a dictionary's word list, 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 word list

For example,

Given:
beginWord = "hit"
endWord = "cog"
wordList = ["hot","dot","dog","lot","log"]

As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",

return its length 5.

class Solution {
public:
int ladderLength(string beginWord, string endWord, unordered_set<string>& wordList) {
if(beginWord.size() != endWord.size()) return 0;
if(beginWord.empty() || endWord.empty())return 0;

queue<string> path;
path.push(beginWord);
int level = 1;
int count = 1;
wordList.erase(beginWord);
while(wordList.size() > 0 && !path.empty())
{
string curword = path.front();
path.pop();count--;
for(int i = 0; i < curword.size(); i++)
{
string tmp = curword;
for(char j='a'; j<='z'; j++)
{
if(tmp[i]==j)continue;
tmp[i] = j;
if(tmp==endWord)return level+1;
if(wordList.find(tmp) != wordList.end()) path.push(tmp);
wordList.erase(tmp);
}
}
if(count==0)
{
count = path.size();
level++;
}
}
return 0;
}
};

0
0

个人资料
• 访问：84399次
• 积分：2494
• 等级：
• 排名：第17425名
• 原创：148篇
• 转载：119篇
• 译文：0篇
• 评论：6条
个人主页
文章分类
最新评论