LeetCode word latter
来源:互联网 发布:mac 系统 编辑:程序博客网 时间:2024/06/06 13:13
题目描述
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start toend, such that:
- Only one letter can be changed at a time
- 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 length5.
Note:
- Return 0 if there is no such transformation sequence.
- All words have the same length.
- All words contain only lowercase alphabetic characters.
ac代码
class Solution {
public:
int ladderLength(string start, string end, unordered_set<string> &dict) {
int length = 0;
queue<string> queue;
string prev = start;
int high = 1;
//int level = 1;
queue.push(start);
while (!queue.empty())
{//high记录高度
int size = queue.size();
while (size--)
{
string prev = queue.front();
queue.pop();
char ch;
for (int i = 0; i < prev.length(); i++)
{
ch = prev[i];
for (int j = 0; j < 26; j++)
{
prev[i] = 'a' + j;
if (prev == end)
return high+1;
if (dict.find(prev) != dict.end())
{
queue.push(prev);
dict.erase(prev);
}
}
prev[i] = ch;
}
}
high++;
}
return 0;
}
};
- LeetCode word latter
- [Leetcode] Word Break、Word BreakII
- leetcode Word Break & Word Break ||
- LeetCode: Word Search
- [Leetcode] Word Search
- LeetCode : Word Search
- Leetcode: Word Search
- [LeetCode] Word Search
- leetcode 56: Word Search
- [Leetcode] Word Ladder
- Leetcode 79 Word Search
- LeetCode: Word Ladder
- leetcode 84: Word Ladder
- [leetcode ] word search
- [Leetcode] Word Search
- [leetcode] word ladder
- 【leetcode】Word Ladder
- 【leetcode】Word Ladder II
- 视频真实地址解析分析思想(腾讯为例)
- BOM、DOM、事件、正则表达式
- js判断ios设备安卓设备
- 面向对象概念
- 给recycleview添加头布局并能点击item多个子控件
- LeetCode word latter
- 【安全牛学习笔记】http特点
- 屏蔽输入法、显示光标
- RequestMapping传值
- 用brew安装node遇到的问题
- 对dp,sp,px等单位的简单解析
- 手把手教你配置Ubuntu server服务器_1
- 微信公众平台测试账号的获取及开发使用【微信开发学习】
- Python-集合