Skip to content

Commit 108d1aa

Browse files
liuyuboboboliuyubobobo
committed
readme updated.
1 parent 32a2581 commit 108d1aa

File tree

1 file changed

+21
-21
lines changed

1 file changed

+21
-21
lines changed

‎README.md

Lines changed: 21 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -121,34 +121,34 @@
121121
| 本章课程最终代码 | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Chapter-05-Completed-Code) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(Java)/Chapter-05-Completed-Code/src/bobo/algo) |
122122
| 补充1 二分查找法改变变量定义，论如何写出正确算法 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第三章1，2小节](http://coding.imooc.com/lesson/82.html#mid=2656) |
123123
| 补充2 二分搜索法的floor和ceil | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-01-More-About-Binary-Search) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-01-More-About-Binary-Search/src/bobo/algo) |
124-
| 补充3 二分搜索法的lower_bound和upper_bound | [整理中] | [敬请期待] |
125-
| 补充4 二分搜索树中的floor和ceil | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-02-Floor-and-Ceil) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-02-Floor-and-Ceil/src/bobo/algo) |
126-
| 补充5 二分搜索树中的前驱和后继 | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-03-Predecessor-and-Successor) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-03-Predecessor-and-Successor/src/bobo/algo) |
127-
| 补充6 二分搜索树中的rank和select | [整理中] | [敬请期待] |
128-
| 补充7 二分搜索树前中后序非递归遍历<br/>深入理解非递归和递归的区别，以及非递归和栈的关系 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第六章2，3小节](http://coding.imooc.com/lesson/82.html#mid=2675) |
129-
| 补充8 二分搜索树整体的非递归实现 | [整理中] | [敬请期待] |
130-
| 补充9 二分搜索树的另一个应用：Set | [整理中] | [敬请期待] |
131-
| 补充10 允许重复键值的二分搜索树 | [整理中] | [敬请期待] |
132-
| 补充11 拥有指向父节点指针Node的二分搜索树 | [整理中] | [敬请期待] |
133-
| 补充12 更多二分搜索树相关的面试问题 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第七章](http://coding.imooc.com/lesson/82.html#mid=2681) |
124+
| 补充3 二分搜索树中的floor和ceil | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-02-Floor-and-Ceil) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-02-Floor-and-Ceil/src/bobo/algo) |
125+
| 补充4 二分搜索树中的前驱和后继 | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-03-Predecessor-and-Successor) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-03-Predecessor-and-Successor/src/bobo/algo) |
126+
| 补充5 二分搜索树中的rank和select | [整理中] | [敬请期待] |
127+
| 补充6 二分搜索树前中后序非递归遍历<br/>深入理解非递归和递归的区别，以及非递归和栈的关系 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第六章2，3小节](http://coding.imooc.com/lesson/82.html#mid=2675) |
128+
| 补充7 二分搜索树整体的非递归实现 | [整理中] | [敬请期待] |
129+
| 补充8 二分搜索树的另一个应用：Set | [整理中] | [敬请期待] |
130+
| 补充9 允许重复键值的二分搜索树 | [整理中] | [敬请期待] |
131+
| 补充10 拥有指向父节点指针Node的二分搜索树 | [整理中] | [敬请期待] |
132+
| 补充11 更多二分搜索树（或者二叉树）相关的面试问题 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第七章](http://coding.imooc.com/lesson/82.html#mid=2681) |
133+
| 补充12 二叉树的公共祖先 (LCA) | [整理中] | [敬请期待] |
134134
| 补充13 树形问题和回溯法 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第八章](http://coding.imooc.com/lesson/82.html#mid=2687) |
135135
| 补充14 树形问题之八皇后问题 | [玩转算法面试](http://coding.imooc.com/class/82.html#Anchor) | [第八章第8小节](http://coding.imooc.com/lesson/82.html#mid=2695) |
136136
| 补充15 走迷宫 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第五章](http://coding.imooc.com/lesson/138.html#mid=7064) |
137137
| 补充16 树形问题之 Move the Box 求解 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第八章](http://coding.imooc.com/lesson/138.html#mid=7440) |
138138
| 补充17 Trie | [整理中] | [敬请期待] |
139-
| 补充18 区间树 | [整理中] | [敬请期待] |
139+
| 补充18 区间树(线段树) | [整理中] | [敬请期待] |
140140
| 补充19 KD树 | [整理中] | [敬请期待] |
141141
| 补充20 哈夫曼树 | [整理中] | [敬请期待] |
142-
| 补充21 使用哈夫曼树进行文件压缩 (Java) | [整理中] | [敬请期待] |
142+
| 补充21 使用哈夫曼树进行文件压缩 | [整理中] | [敬请期待] |
143143
| 补充22 红黑树 | [整理中] | [敬请期待] |
144144
| 补充23 AVL | [整理中] | [敬请期待] |
145-
| 补充24 Treap | [整理 中] | [敬请期待] |
146-
| 补充25 伸展树 | [整理中] | [敬请期待] |
147-
| 补充26 B树 | [整理中] | [敬请期待] |
145+
| 补充24 伸展树 | [整理中] | [敬请期待] |
146+
| 补充25 B树 | [整理中] | [敬请期待] |
147+
| 补充26 Treap | [整理 中] | [敬请期待] |
148148
| 补充27 树形问题之数独求解 | [整理中] | [敬请期待] |
149149
| 补充28 数独求解之特殊数据结构 | [整理中] | [敬请期待] |
150-
| 补充29 树形问题之推箱子自动求解 | [整理中] | [敬请期待] |
151-
| 补充30 树形问题之八数码问题 (A*算法初步) | [整理中] | [敬请期待] |
150+
| 补充29 树形问题之八数码问题 (A*算法初步) | [整理中] | [敬请期待] |
151+
| 补充30 树形问题之推箱子自动求解 | [整理中] | [敬请期待] |
152152
| **第六章 并查集** | [章节C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/06-Union-Find/Course%20Code%20(C%2B%2B)) | [章节Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/06-Union-Find/Course%20Code%20(Java)) |
153153
| 6-1 并查集基础（Union Find）| [无代码] | |
154154
| 6-2 Quick Find | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/06-Union-Find/Course%20Code%20(C%2B%2B)/02-Quick-Find) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/06-Union-Find/Course%20Code%20(Java)/02-Quick-Find/src/bobo/algo) |
@@ -191,10 +191,10 @@
191191
| 8-6 Kruskal算法 | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/06-Kruskal-Algorithm) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/08-Minimum-Span-Trees/Course%20Code%20(Java)/06-Kruskal-Algorithm/src/bobo/algo) |
192192
| 8-7 最小生成树算法的思考 | [无代码] | |
193193
| 本章课程最终代码 | [C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/Chapter-08-Completed-Code) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/08-Minimum-Span-Trees/Course%20Code%20(Java)/Chapter-08-Completed-Code/src/bobo/algo) |
194-
| 补充1 图的最小生成树的个数 | [整理中] | [敬请期待] |
195-
| 补充2 Vyssotsky Algorithm | [整理中] | [敬请期待] |
196-
| 补充3 Prim算法可视化 (Java) | [整理中] | [敬请期待] |
197-
| 补充4 Kruskal算法可视化 (Java) | [整理中] | [敬请期待] |
194+
| 补充1 Prim算法可视化 (Java) | [整理中] | [敬请期待] |
195+
| 补充2 Kruskal算法可视化 (Java) | [整理中] | [敬请期待] |
196+
| 补充3 图的最小生成树的个数 | [整理中] | [敬请期待] |
197+
| 补充4 Vyssotsky Algorithm | [整理中] | [敬请期待] |
198198
| **第九章 最短路径** | [章节C++源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/09-Shortest-Path/Course%20Code%20(C%2B%2B)) | [章节Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/tree/master/09-Shortest-Path/Course%20Code%20(Java)) |
199199
| 9-1 最短路径问题和松弛操作(Relaxation) | [无代码] | |
200200
| 9-2 Dijkstra的算法思想 | [无代码] | |

0 commit comments

Comments
 (0)