题目如下,好长
思路分析
广搜搜到了就一定是最短转换序列
这里要说一下广搜都是用队列,深搜用堆栈
这里的广搜就是beginword,每个位置26个字母全变一次进去查找,查找到了该字母就路径+1,然后入队,等着这一层搜完之后继续搜。当然如果等于endword就直接输出了。
class Solution {
public:
int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
unordered_set<string> wordSet(wordList.begin(), wordList.end());
if(!wordSet.count(endWord)) return 0;
//用pathCount记录路径,转换到某一个字符串所需长度
unordered_map<string, int> pathCount{{{beginWord, 1}}};
queue<string> q{{beginWord}};
while(!q.empty()){
string word = q.front();
q.pop();
for(int i = 0; i < word.size(); i++){
string newWord = word;
for(char c = 'a'; c <= 'z'; c++){
newWord[i] = c;
if(wordSet.count(newWord) && newWord == endWord) return pathCount[word] + 1;
if(wordSet.count(newWord) && !pathCount.count(newWord)){
pathCount[newWord] = pathCount[word] + 1;
q.push(newWord);
}
}
}
}
return 0;
}
};