增加总结和练习题

Author: xingdali

基础算法篇/二分搜索.md

@@ -370,3 +370,22 @@ var search = function (nums, target) {
 };
 ```
 
+## 总结
+
+二分搜索核心四点要素（必背&理解）
+
+- 1、初始化：start=0、end=len-1
+- 2、循环退出条件：start + 1 < end
+- 3、比较中点和目标值：A[mid] ==、 <、> target
+- 4、判断最后两个元素是否符合：A[start]、A[end] ? target
+
+## 练习题
+
+-  [search-for-range](https://www.lintcode.com/problem/search-for-a-range/description)
+-  [search-insert-position](https://leetcode-cn.com/problems/search-insert-position/)
+-  [search-a-2d-matrix](https://leetcode-cn.com/problems/search-a-2d-matrix/)
+-  [first-bad-version](https://leetcode-cn.com/problems/first-bad-version/)
+-  [find-minimum-in-rotated-sorted-array](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/)
+-  [find-minimum-in-rotated-sorted-array-ii](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/)
+-  [search-in-rotated-sorted-array](https://leetcode-cn.com/problems/search-in-rotated-sorted-array/)
+-  [search-in-rotated-sorted-array-ii](https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/)

基础算法篇/动态规划.md

@@ -449,3 +449,31 @@ function backpack(m: number, A: number[]): number {
 }
 ```
 
+## 练习
+
+Matrix DP (10%)
+
+-  [triangle](https://leetcode-cn.com/problems/triangle/)
+-  [minimum-path-sum](https://leetcode-cn.com/problems/minimum-path-sum/)
+-  [unique-paths](https://leetcode-cn.com/problems/unique-paths/)
+-  [unique-paths-ii](https://leetcode-cn.com/problems/unique-paths-ii/)
+
+Sequence (40%)
+
+-  [climbing-stairs](https://leetcode-cn.com/problems/climbing-stairs/)
+-  [jump-game](https://leetcode-cn.com/problems/jump-game/)
+-  [jump-game-ii](https://leetcode-cn.com/problems/jump-game-ii/)
+-  [palindrome-partitioning-ii](https://leetcode-cn.com/problems/palindrome-partitioning-ii/)
+-  [longest-increasing-subsequence](https://leetcode-cn.com/problems/longest-increasing-subsequence/)
+-  [word-break](https://leetcode-cn.com/problems/word-break/)
+
+Two Sequences DP (40%)
+
+-  [longest-common-subsequence](https://leetcode-cn.com/problems/longest-common-subsequence/)
+-  [edit-distance](https://leetcode-cn.com/problems/edit-distance/)
+
+Backpack & Coin Change (10%)
+
+-  [coin-change](https://leetcode-cn.com/problems/coin-change/)
+-  [backpack](https://www.lintcode.com/problem/backpack/description)
+-  [backpack-ii](https://www.lintcode.com/problem/backpack-ii/description)

基础算法篇/排序算法.md

@@ -1,3 +1,5 @@
+## 排序算法
+
 #### 快速排序
 
 ```js

数据结构篇/二叉树.md

@@ -475,3 +475,20 @@ var insertIntoBST = function (root, val) {
 };
 ```
 
+## 总结
+
+- 掌握二叉树递归与非递归遍历
+- 理解 DFS 前序遍历与分治法
+- 理解 BFS 层次遍历
+
+## 练习
+
+-  [maximum-depth-of-binary-tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/)
+-  [balanced-binary-tree](https://leetcode-cn.com/problems/balanced-binary-tree/)
+-  [binary-tree-maximum-path-sum](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/)
+-  [lowest-common-ancestor-of-a-binary-tree](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/)
+-  [binary-tree-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/)
+-  [binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)
+-  [binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/)
+-  [validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/)
+-  [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)

算法思维/递归思维.md

@@ -105,3 +105,10 @@ function fib(n: number): number {
 };
 ```
 
+## 练习
+
+-  [reverse-string](https://leetcode-cn.com/problems/reverse-string/)
+-  [swap-nodes-in-pairs](https://leetcode-cn.com/problems/swap-nodes-in-pairs/)
+-  [unique-binary-search-trees-ii](https://leetcode-cn.com/problems/unique-binary-search-trees-ii/)
+-  [fibonacci-number](https://leetcode-cn.com/problems/fibonacci-number/)
+