127. Word Ladder
来源:互联网 发布:java打包package 编辑:程序博客网 时间:2024/06/05 15:46
问题描述
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:Only one letter can be changed at a time.
Each transformed word must exist in the word list. Note that beginWord is not a transformed word.
For example,Given:
beginWord = “hit”
endWord = “cog”
wordList = [“hot”,”dot”,”dog”,”lot”,”log”,”cog”]
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.
You may assume no duplicates in the word list.
You may assume beginWord and endWord are non-empty and are not the same.解决思路
找到当前字符串与它相差一个字符的字符串作为它的子节点,然后进行广搜即可。代码
class Solution {public: int ladderLength(string beginWord, string endWord, vector<string>& wordList) { vector<bool> isVisit(wordList.size(),0); queue<string> que,next; que.push(beginWord); int count = wordList.size(), len = 0; for (int i = 0; i < wordList.size(); ++i) { if(beginWord == wordList[i]) { isVisit[i] = true; --count; break; } } while(!que.empty() || count) { string tmp = que.front(); que.pop(); if (tmp == endWord) return len+1; for (int i = 0; i < wordList.size(); ++i) { int new_count = 0; for (int j = 0; j < beginWord.length(); ++j) { if(tmp[j] != wordList[i][j]) ++new_count; } if (new_count == 1 && !isVisit[i]) { isVisit[i] = true; next.push(wordList[i]); --count; } } //cout<<"next's size" << next.size() <<endl; if (que.empty()) { if (next.empty()) return 0; que = next; next = queue<string>(); ++len; } } //cout <<"count: "<<count<<endl; return 0; }};
- [LeetCode]127.Word Ladder
- [Leetcode] 127. Word Ladder
- 127. Word Ladder
- [leetcode] 127.Word Ladder
- Leetcode-127.Word Ladder
- 127. Word Ladder LeetCode
- Leetcode 127. Word Ladder
- LeetCode 127. Word Ladder
- 127.Word Ladder
- 127. Word Ladder
- leetcode 127. Word Ladder
- 127. Word Ladder
- LeetCode 127. Word Ladder
- LeetCode-127.Word Ladder
- Leetcode 127. Word Ladder
- 127. Word Ladder
- [leetcode] 127. Word Ladder
- 127. Word Ladder (很重要!!!)
- 《机器学习》中的特殊字体
- nyoj289 01背包模板
- Filter的创建和使用以及基础知识
- 库函数
- asp ajax JQuery UI 链接及插件
- 127. Word Ladder
- Android 3D开发,OpenGL ES 的使用(一)
- Find them, Catch them POJ
- [Swift]7.0函数
- 数据库连接配置不匹配
- C#笔记整理(二)
- 贪心
- UNIX环境高级编程习题3.2 自己实现dup2函数功能
- react + webpack + less 豆瓣电影