[Leetcode] 127. Word Ladder
来源:互联网 发布:eplan软件 64位 编辑:程序博客网 时间:2024/04/30 21:11
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, 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 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.
import java.util.HashSet;import java.util.LinkedList;public class Solution { public int ladderLength(String start, String end, Set<String> dict) { if(start == null || end == null || dict == null || dict.size() == 0) return 0; Queue<String> queue = new LinkedList<String>(); queue.offer(start); dict.remove(start); int length = 1; while(!queue.isEmpty()){ int size = queue.size(); for(int i = 0; i < size; i++){ String current = queue.poll(); for(char c = 'a'; c < 'z'; c++){ for(int j = 0; j < current.length(); j++){ if(c == current.charAt(j)){ continue; } String temp = replace(current, j, c); if(temp.equals(end)){ return length + 1; } if(dict.contains(temp)){ queue.offer(temp); dict.remove(temp); } } } } length++; } return 0; } private String replace(String s, int index, char c) { char[] chars = s.toCharArray(); chars[index] = c; return new String(chars); }}
0 0
- [LeetCode]127.Word Ladder
- [Leetcode] 127. Word Ladder
- [leetcode] 127.Word Ladder
- Leetcode-127.Word Ladder
- 127. Word Ladder LeetCode
- Leetcode 127. Word Ladder
- LeetCode 127. Word Ladder
- leetcode 127. Word Ladder
- LeetCode 127. Word Ladder
- LeetCode-127.Word Ladder
- Leetcode 127. Word Ladder
- [leetcode] 127. Word Ladder
- [LeetCode] 127. Word Ladder
- 【LeetCode】127. Word Ladder
- LeetCode 127. Word Ladder
- Leetcode-127. Word Ladder
- LeetCode 127. Word Ladder
- Leetcode 127. Word Ladder
- 游戏引擎理论与实现系列01-生成窗口
- mysqldump 备份
- 游戏引擎理论与实现系列03-生成图像
- ABAP 例程程序在SAP BW TRANFORMATION中的应用,去除非法字符
- [Leetcode] 126. Word Ladder II
- [Leetcode] 127. Word Ladder
- Blog hello world
- WPF Commend 命令
- 3月30日--4月8日(共20小时,剩3800小时)
- 查看路由信息的几种方法
- 【spring-mvc】SpringMVC中的转发与重定向
- ubutu下Sublime Text 2的安装
- 第一章遇见的问题(题目是原创,答案转载收集互联网)
- (others)路由器1