- 浏览: 130549 次
文章分类
- 全部博客 (189)
- Tree (14)
- Dynamic Programming (34)
- Array (20)
- Search (1)
- Hash (12)
- Backtracking (22)
- Divide and Conque (8)
- Greedy (6)
- Stack (12)
- software (0)
- List (7)
- Math (22)
- Two pointers (16)
- String (20)
- Linux (1)
- Sliding Window (4)
- Finite State Machine (1)
- Breadth-first Search (7)
- Graph (4)
- DFS (6)
- BFS (3)
- Sort (9)
- 基础概念 (2)
- 沟通表达 (0)
- Heap (2)
- Binary Search (15)
- 小结 (1)
- Bit Manipulation (8)
- Union Find (4)
- Topological Sort (1)
- PriorityQueue (1)
- Design Pattern (1)
- Design (1)
- Iterator (1)
- Queue (1)
最新评论
-
likesky3:
看了数据结构书得知并不是迭代和递归的区别,yb君的写法的效果是 ...
Leetcode - Graph Valid Tree -
likesky3:
迭代和递归的区别吧~
Leetcode - Graph Valid Tree -
qb_2008:
还有一种find写法:int find(int p) { i ...
Leetcode - Graph Valid Tree -
qb_2008:
要看懂这些技巧的代码确实比较困难。我是这么看懂的:1. 明白这 ...
Leetcode - Single Num II -
qb_2008:
public int singleNumber2(int[] ...
Leetcode - Single Num II
Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) 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"]
Return
[
["hit","hot","dot","dog","cog"],
["hit","hot","lot","log","cog"]
]
Note:
All words have the same length.
All words contain only lowercase alphabetic characters.
[分析] 这是一道呼唤耐心的题目,基本思路和word ladder一致,利用BFS搜索出最短路径,所不同的是这题需要找出所有最短路径,因此在搜索时需要记录搜索路径以便于最后进行回溯。有几个关键的细节需要注意:
1)搜索到一个可供跳转的单词时不能像word ladder题中那样立即删除,需要遍历完当前层后再统一从dict中删除下一层的单词,考虑这种情况:input= {"bet", "hat", ["bet", "bit", "bot", "hit", "hot", "hat"]},遍历第三层hit时,若直接删除hat,则最终output会少一条从hot到hat的路径。遍历每层时使用visited集合记录所有下一层单词,该层遍历结束后从dict中删除该层对应的visited集合。
2)反方向搜索,即从end往start搜,可提高回溯时的效率,因为构造路径时可顺序添加而无需插入在数组头部(会有隐藏的数组移位操作)。
3)为了方便回溯,反向搜索过程中要记录当前元素的前驱(output路径方向看),可使用HashMap,key为当前元素,value是key的前驱列表。正向搜索记录后继也是可行的,但实现起来会麻烦些,因为在遍历过程中找到的后继不一定最终能导向end,在回溯时需要进行额外判断,不然可能会空指针。
4) 忽略if (visited.add(newStr))这个条件直接queue.offer(newStr)会导致超时,因为queue中会加入重复元素
先参照http://blog.csdn.net/linhuanmars/article/details/23071455 稍微修改了如Method1所示,然后再此基础上修改了自己初始的想法得到Method 2实现
[ref]
http://www.cnblogs.com/TenosDoIt/p/3443512.html
http://blog.csdn.net/linhuanmars/article/details/23071455
http://blog.csdn.net/u013325815/article/details/42043051
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"]
Return
[
["hit","hot","dot","dog","cog"],
["hit","hot","lot","log","cog"]
]
Note:
All words have the same length.
All words contain only lowercase alphabetic characters.
[分析] 这是一道呼唤耐心的题目,基本思路和word ladder一致,利用BFS搜索出最短路径,所不同的是这题需要找出所有最短路径,因此在搜索时需要记录搜索路径以便于最后进行回溯。有几个关键的细节需要注意:
1)搜索到一个可供跳转的单词时不能像word ladder题中那样立即删除,需要遍历完当前层后再统一从dict中删除下一层的单词,考虑这种情况:input= {"bet", "hat", ["bet", "bit", "bot", "hit", "hot", "hat"]},遍历第三层hit时,若直接删除hat,则最终output会少一条从hot到hat的路径。遍历每层时使用visited集合记录所有下一层单词,该层遍历结束后从dict中删除该层对应的visited集合。
2)反方向搜索,即从end往start搜,可提高回溯时的效率,因为构造路径时可顺序添加而无需插入在数组头部(会有隐藏的数组移位操作)。
3)为了方便回溯,反向搜索过程中要记录当前元素的前驱(output路径方向看),可使用HashMap,key为当前元素,value是key的前驱列表。正向搜索记录后继也是可行的,但实现起来会麻烦些,因为在遍历过程中找到的后继不一定最终能导向end,在回溯时需要进行额外判断,不然可能会空指针。
4) 忽略if (visited.add(newStr))这个条件直接queue.offer(newStr)会导致超时,因为queue中会加入重复元素
先参照http://blog.csdn.net/linhuanmars/article/details/23071455 稍微修改了如Method1所示,然后再此基础上修改了自己初始的想法得到Method 2实现
[ref]
http://www.cnblogs.com/TenosDoIt/p/3443512.html
http://blog.csdn.net/linhuanmars/article/details/23071455
http://blog.csdn.net/u013325815/article/details/42043051
// Method 2: 去除Method1 的辅助数据结构 public class Solution1 { public List<List<String>> findLadders(String start, String end, Set<String> dict) { List<List<String>> result = new ArrayList<List<String>>(); LinkedList<String> queue = new LinkedList<String>(); queue.add(end); HashMap<String, ArrayList<String>> nextMap = new HashMap<String, ArrayList<String>>(); HashSet<String> visited = new HashSet<String>(); dict.add(start); dict.remove(end); int currLevel = 1, nextLevel = 0; int L = start.length(); boolean found = false; while (!queue.isEmpty()) { String currStr = queue.poll(); if (currLevel == 0) { if (found) break; currLevel = nextLevel; nextLevel = 0; dict.removeAll(visited); visited.clear(); } char[] currCharArray = currStr.toCharArray(); for (int i = 0; i < L; i++) { char oldChar = currCharArray[i]; boolean foundCurCycle = false; for (char c = 'a'; c <= 'z'; c++) { if (c == oldChar) continue; currCharArray[i] = c; String newStr = new String(currCharArray); if (dict.contains(newStr)) { if (!nextMap.containsKey(newStr)) { nextMap.put(newStr, new ArrayList<String>()); } nextMap.get(newStr).add(currStr); // 务必先更新nextMap再判断搜索是否结束,否则nextMap可能最终为空 if (newStr.equals(start)) { found = true; foundCurCycle = true; break; } if (visited.add(newStr)) { queue.offer(newStr); nextLevel++; } } } currCharArray[i] = oldChar; if (foundCurCycle) break; } currLevel--; } if (found) { List<String> item = new ArrayList<String>(); item.add(start); getPath(start, end, item, nextMap, result); } return result; } public void getPath(String start, String end, List<String> item, HashMap<String, ArrayList<String>> nextMap, List<List<String>> result) { if (start.equals(end)) { result.add(new ArrayList<String>(item)); } else { ArrayList<String> nextList = nextMap.get(start); for (String next : nextList) { item.add(next); getPath(next, end, item, nextMap, result); item.remove(item.size() - 1); } } } }
// Method 1, 参考下面链接修改 // http://blog.csdn.net/linhuanmars/article/details/23071455 public class Solution { class StringWithLevel { String str; int level; public StringWithLevel(String str, int level) { this.str = str; this.level = level; } } public List<List<String>> findLadders(String start, String end, Set<String> dict) { List<List<String>> result = new ArrayList<List<String>>(); LinkedList<StringWithLevel> queue = new LinkedList<StringWithLevel>(); queue.add(new StringWithLevel(end, 0)); HashMap<String, ArrayList<String>> nextMap = new HashMap<String, ArrayList<String>>(); HashSet<String> visited = new HashSet<String>(); dict.add(start); dict.remove(end); int currLevel = 0, preLevel = 0; int L = start.length(); boolean found = false; while (!queue.isEmpty()) { StringWithLevel curr = queue.poll(); String currStr = curr.str; currLevel = curr.level; if (currLevel > preLevel) { if (found) break; preLevel = currLevel; dict.removeAll(visited); visited.clear(); } char[] currCharArray = currStr.toCharArray(); for (int i = 0; i < L; i++) { char oldChar = currCharArray[i]; boolean foundCurCycle = false; for (char c = 'a'; c <= 'z'; c++) { if (c == oldChar) continue; currCharArray[i] = c; String newStr = new String(currCharArray); if (dict.contains(newStr)) { ArrayList<String> nextList = null; if (nextMap.containsKey(newStr)) { nextList = nextMap.get(newStr); } else { nextList = new ArrayList<String>(); } nextList.add(currStr); nextMap.put(newStr, nextList); if (newStr.equals(start)) { found = true; foundCurCycle = true; break; } if (visited.add(newStr)) queue.offer(new StringWithLevel(newStr, currLevel + 1)); // enqueue a new item of next level } } currCharArray[i] = oldChar; if (foundCurCycle) break; // can not use found here, or will miss some paths } } if (found) { List<String> item = new ArrayList<String>(); item.add(start); getPath(start, end, item, nextMap, result); } return result; } public void getPath(String start, String end, List<String> item, HashMap<String, ArrayList<String>> nextMap, List<List<String>> result) { if (start.equals(end)) { result.add(new ArrayList<String>(item)); } else { ArrayList<String> nextList = nextMap.get(start); for (String next : nextList) { item.add(next); getPath(next, end, item, nextMap, result); item.remove(item.size() - 1); } } } }
发表评论
-
Leetcode - Palindrome Permutation II
2015-08-28 21:17 2185Given a string s, return all th ... -
Leetcode - Factor Combination
2015-08-28 09:53 821Numbers can be regarded as prod ... -
Leetcode - Generate Parentheses
2015-08-08 17:01 485[分析] 第一个思路(错误的~):假设递归函数返回 n - ... -
Leetcode - Word Search II
2015-08-03 21:25 935iven a 2D board and a list of w ... -
Leetcode - Word Search
2015-08-03 21:03 479Given a 2D board and a word, fi ... -
Leetcode - Subset
2015-08-02 12:06 915[分析] 三种思路 思路1:每层递归新加一个元素,第一层递归, ... -
Leetcode - Subset II
2015-08-02 12:13 922[分析] 延续Subset三种思路,关键是添加去重处理 思路 ... -
Leetcode - Gray Code
2015-08-01 17:26 545原题链接:https://leetcode.com/probl ... -
Leetcode - Permutation Sequence
2015-08-01 17:19 481原题链接:https://leetcode.com/probl ... -
Leetcode - Permutation II
2015-08-01 10:49 568原题链接:https://leetcode.com/probl ... -
Leetcode - Combination
2015-08-01 08:36 458[分析] 从 n 个数中取 k 个数,第一个数有 n 种取法… ... -
Leetcode - Combination Sum III
2015-07-31 22:04 499[分析] 思路就是枚举k个数所有可能的组合并判断是否符合条件。 ... -
Leetcode - Combination Sum II
2015-07-31 21:06 576[分析] 输入数组中的每个元素至多使用一次,相较于Combin ... -
Leetcode - Combination Sum
2015-07-31 20:21 554Given a set of candidate number ... -
Leetcode - Sudoku Solver
2015-07-31 09:14 434[分析] 做Valid Sudoku时表示3*3区块的下标想得 ... -
Leetcode - N Queues II
2015-07-30 20:52 377[分析] 做完N皇后第一题,这个就so easy~ pu ... -
Leetcode - N-Queens
2015-07-30 20:38 407[分析] N皇后摆放规则:两个皇后不能共存于同一行、同一列以及 ... -
Leetcode - Majority Element II
2015-06-30 22:12 807[分析] Majority Element II这个扩展版可以 ... -
Leetcode - Course Schedule II
2015-06-29 22:03 451There are a total of n courses ... -
Leetcode - Clone Graph
2015-06-29 21:59 456Clone an undirected graph. Each ...
相关推荐
《leetcode-solutions》,刷算法题,需要有一定的英文阅读能力。。。
Algorithm-LeetCode-Sol-Res.zip,干净,易懂的解决方案和资源,为leetcode在线判断算法问题。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
IDEA 插件,lettcode刷题,leetcode-editor7.4版本下载进行本地导入(直接将压缩包拖进IDEA即可)
Algorithm-leetcode-spider.zip,leetcode公司,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
leetcode-cli-plugins leetcode-cli 的第 3 方插件。 什么是 如何使用 如何使用 插件 名称 描述 增强的命令 按公司或标签过滤问题 list 不要在同一台计算机上使 Chrome 的会话过期 login 不要在同一台计算机上使 ...
在IDE中解决LeetCode问题,支持leetcode.com与leetcode-cn.com,满足基本的做题需求。 理论上支持: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio。
解题思路思路和LeetCode-python 503.下一个更大元素 II一致,只是这里求的是下标的距离,而不是数值倒序搜索,用到栈,栈里存储索引情况1:若栈为
leetcode 答案解析 golang解答
leetcode-cheat 的发布 它是什么 ? 这是一个chrome 扩展,可以帮助您更高效地使用 leetcode。您可以从 重要: leetcode-cheat 现在只支持中文版。 也就是说不完全支持leetcode.com,但是你可以用leetcode-cn.com代替...
~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/vsc-leetcode-cli/bin/leetcode /usr/local/bin/leetcode 修改模板 open ~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/...
leetcode-editor,在ide中做leetcode练习,支持leetcode.com和leetcode-cn.com,以满足练习的基本需求。理论上支持:intellij idea phpstorm webstorm pycharm rubymine appcode clion goland datagrip rider mps ...
leetcode-helper-1.7.1
leetcode-tag-dynamic programming
970. 强整数对数运算function powerfulIntegers(x: number, y: number, bound: number): numb
然后进入到LeetCode-Spider目录中修改config.json,其中outputDir需要填写该工程的/docs/views文件夹路径 { "username": "aaa", "password": "bbb", "outputDir": "/Users/liuyao/Downloads/LeetCode-Blog-Test/docs...
leetcode-cli 注意:这个存储库是为了临时使用而分叉的。 注意:从 webbrowser 复制 cookie 并使用leetcode user -c可以临时修复不能。 一个享受 leetcode 的高效 cli 工具! 非常感谢 leetcode.com,一个非常棒的...
leetcode-tag-Tree
leetcode-tag-Stack
leetcode-tag-array