fix: 电子书勘误

.gitignore

@@ -2,7 +2,11 @@
 _book/
 .idea/*
 node_modules/
-book.pdf
-book.mobi
-book.epub
-book.zip
+西法的刷题秘籍*.pdf
+西法的刷题秘籍*.mobi
+西法的刷题秘籍*.epub
+西法的刷题秘籍*.zip
+book*.pdf
+book*.mobi
+book*.epub
+book*.zip

SUMMARY.md

@@ -5,7 +5,6 @@
 
 * [第一章 - 算法专题](thinkings/README.md)
     * [数据结构](thinkings/basic-data-structure.md)
-    * [基础算法](thinkings/basic-algorithm.md)
     * [二叉树的遍历](thinkings/binary-tree-traversal.md)
     * [动态规划](thinkings/dynamic-programming.md)
     * [哈夫曼编码和游程编码](thinkings/run-length-encode-and-huffman-encode.md)
@@ -123,7 +122,6 @@
     * [0098. 验证二叉搜索树](problems/98.validate-binary-search-tree.md)
     * [0102. 二叉树的层序遍历](problems/102.binary-tree-level-order-traversal.md)
     * [0103. 二叉树的锯齿形层次遍历](problems/103.binary-tree-zigzag-level-order-traversal.md)
-    * [105. 从前序与中序遍历序列构造二叉树](problems/105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md)
     * [0113. 路径总和 II](problems/113.path-sum-ii.md)
     * [0129. 求根到叶子节点数字之和](problems/129.sum-root-to-leaf-numbers.md)
     * [0130. 被围绕的区域](problems/130.surrounded-regions.md)

collections/easy.md

@@ -4,41 +4,40 @@
 
 当然也不排除很多 hard 题目也可以暴力模拟，大家平时多注意数据范围即可。
 
-- [面试题 17.12. BiNode](../problems/binode-lcci.md) 🆕
-
-- [0001.two-sum](https://github.com/azl397985856/leetcode/blob/master/problems/1.two-sum.md)
-- [0020.Valid Parentheses](../problems/20.valid-parentheses.md)
-- [0021.MergeTwoSortedLists](../problems/21.merge-two-sorted-lists.md)
-- [0026.remove-duplicates-from-sorted-array](../problems/26.remove-duplicates-from-sorted-array.md)
-- [0053.maximum-sum-subarray](../problems/53.maximum-sum-subarray-cn.md)
-- [0088.merge-sorted-array](../problems/88.merge-sorted-array.md)
-- [0101.symmetric-tree](../problems/101.symmetric-tree.md)🆕
-- [0104.maximum-depth-of-binary-tree](../problems/104.maximum-depth-of-binary-tree.md)
-- [0108.convert-sorted-array-to-binary-search-tree](../problems/108.convert-sorted-array-to-binary-search-tree.md)
-- [0121.best-time-to-buy-and-sell-stock](../problems/121.best-time-to-buy-and-sell-stock.md)
-- [0122.best-time-to-buy-and-sell-stock-ii](../problems/122.best-time-to-buy-and-sell-stock-ii.md)
-- [0125.valid-palindrome](../problems/125.valid-palindrome.md)
-- [0136.single-number](../problems/136.single-number.md)
-- [0155.min-stack](../problems/155.min-stack.md) 🆕
-- [0167.two-sum-ii-input-array-is-sorted](../problems/167.two-sum-ii-input-array-is-sorted.md)
-- [0169.majority-element](../problems/169.majority-element.md)
-- [0172.factorial-trailing-zeroes](../problems/172.factorial-trailing-zeroes.md)
-- [0190.reverse-bits](../problems/190.reverse-bits.md)
-- [0191.number-of-1-bits](../problems/191.number-of-1-bits.md)
-- [0198.house-robber](../problems/198.house-robber.md)
-- [0203.remove-linked-list-elements](../problems/203.remove-linked-list-elements.md)
-- [0206.reverse-linked-list](../problems/206.reverse-linked-list.md)
-- [0219.contains-duplicate-ii](../problems/219.contains-duplicate-ii.md)
-- [0226.invert-binary-tree](../problems/226.invert-binary-tree.md)
-- [0232.implement-queue-using-stacks](../problems/232.implement-queue-using-stacks.md) 🆕
-- [0263.ugly-number](../problems/263.ugly-number.md)
-- [0283.move-zeroes](../problems/283.move-zeroes.md)
-- [0342.power-of-four](../problems/342.power-of-four.md)
-- [0349.intersection-of-two-arrays](../problems/349.intersection-of-two-arrays.md)
-- [0371.sum-of-two-integers](../problems/371.sum-of-two-integers.md)
-- [0437.path-sum-iii](../problems/437.path-sum-iii.md) 🆕
-- [0455.AssignCookies](../problems/455.AssignCookies.md) 🆕
-- [0575.distribute-candies](../problems/575.distribute-candies.md)
-- [0874.walking-robot-simulation](../problems/874.walking-robot-simulation.md) 🆕
-- [1260.shift-2d-grid](../problems/1260.shift-2d-grid.md) 🆕
-- [1332.remove-palindromic-subsequences](../problems/1332.remove-palindromic-subsequences.md) 🆕
+- [面试题 17.12. BiNode](problems/binode-lcci.md)
+- [0001. 两数之和](problems/1.two-sum.md)
+- [0020. 有效的括号](problems/20.valid-parentheses.md)
+- [0021. 合并两个有序链表](problems/21.merge-two-sorted-lists.md)
+- [0026. 删除排序数组中的重复项](problems/26.remove-duplicates-from-sorted-array.md)
+- [0053. 最大子序和](problems/53.maximum-sum-subarray-cn.md)
+- [0088. 合并两个有序数组](problems/88.merge-sorted-array.md)
+- [0101. 对称二叉树](problems/101.symmetric-tree.md)
+- [0104. 二叉树的最大深度](problems/104.maximum-depth-of-binary-tree.md)
+- [0108. 将有序数组转换为二叉搜索树](problems/108.convert-sorted-array-to-binary-search-tree.md)
+- [0121. 买卖股票的最佳时机](problems/121.best-time-to-buy-and-sell-stock.md)
+- [0122. 买卖股票的最佳时机 II](problems/122.best-time-to-buy-and-sell-stock-ii.md)
+- [0125. 验证回文串](problems/125.valid-palindrome.md)
+- [0136. 只出现一次的数字](problems/136.single-number.md)
+- [0155. 最小栈](problems/155.min-stack.md)
+- [0167. 两数之和 II * 输入有序数组](problems/167.two-sum-ii-input-array-is-sorted.md)
+- [0169. 多数元素](problems/169.majority-element.md)
+- [0172. 阶乘后的零](problems/172.factorial-trailing-zeroes.md)
+- [0190. 颠倒二进制位](problems/190.reverse-bits.md)
+- [0191. 位1的个数](problems/191.number-of-1-bits.md)
+- [0198. 打家劫舍](problems/198.house-robber.md)
+- [0203. 移除链表元素](problems/203.remove-linked-list-elements.md)
+- [0206. 反转链表](problems/206.reverse-linked-list.md)
+- [0219. 存在重复元素 II](problems/219.contains-duplicate-ii.md)
+- [0226. 翻转二叉树](problems/226.invert-binary-tree.md)
+- [0232. 用栈实现队列](problems/232.implement-queue-using-stacks.md)
+- [0263. 丑数](problems/263.ugly-number.md)
+- [0283. 移动零](problems/283.move-zeroes.md)
+- [0342. 4的幂](problems/342.power-of-four.md)
+- [0349. 两个数组的交集](problems/349.intersection-of-two-arrays.md)
+- [0371. 两整数之和](problems/371.sum-of-two-integers.md)
+- [0437. 路径总和 III](problems/437.path-sum-iii.md)
+- [0455. 分发饼干](problems/455.AssignCookies.md)
+- [0575. 分糖果](problems/575.distribute-candies.md)
+- [0874. 模拟行走机器人](problems/874.walking-robot-simulation.md)
+- [1260. 二维网格迁移](problems/1260.shift-2d-grid.md)
+- [1332. 删除回文子序列](problems/1332.remove-palindromic-subsequences.md)

collections/hard.md

@@ -22,31 +22,30 @@
 2. 暴力枚举所有可能的算法往上套
 3. 总结和记忆解题模板，减少解题压力
 
-- [0004.median-of-two-sorted-array](../problems/4.median-of-two-sorted-arrays.md)
-- [0023.merge-k-sorted-lists](../problems/23.merge-k-sorted-lists.md)
-- [0025.reverse-nodes-in-k-group](../problems/25.reverse-nodes-in-k-groups-cn.md)
-- [0030.substring-with-concatenation-of-all-words](../problems/30.substring-with-concatenation-of-all-words.md)
-- [0032.longest-valid-parentheses](../problems/32.longest-valid-parentheses.md)
-- [0042.trapping-rain-water](../problems/42.trapping-rain-water.md)🖊
-- [0052.N-Queens-II](../problems/52.N-Queens-II.md)
-- [0084.largest-rectangle-in-histogram](../problems/84.largest-rectangle-in-histogram.md)
-- [0085.maximal-rectangle](../problems/85.maximal-rectangle.md)
-- [0124.binary-tree-maximum-path-sum](../problems/124.binary-tree-maximum-path-sum.md)
-- [0128.longest-consecutive-sequence](../problems/128.longest-consecutive-sequence.md)
-- [0145.binary-tree-postorder-traversal](../problems/145.binary-tree-postorder-traversal.md)
-- [0212.word-search-ii](../problems/212.word-search-ii.md)
-- [0239.sliding-window-maximum](../problems/239.sliding-window-maximum.md)
-- [0295.find-median-from-data-stream](../problems/295.find-median-from-data-stream.md)
-- [0301.remove-invalid-parentheses](../problems/301.remove-invalid-parentheses.md)
-- [0312.burst-balloons](../problems/312.burst-balloons.md) 🆕
-- [0335.self-crossPing](../problems/335.self-crossing.md)
-- [0460.lfu-cache](../problems/460.lfu-cache.md)
-- [0472.concatenated-words](../problems/472.concatenated-words.md) 🆕
-- [0488.zuma-game.md](../problems/488.zuma-game.md) 🆕
-- [0493.reverse-pairs](../problems/493.reverse-pairs.md) 🆕
-- [0887.super-egg-drop](../problems/887.super-egg-drop.md)
-- [0895.maximum-frequency-stack](../problems/895.maximum-frequency-stack.md) 🆕
-
-- [1032.stream-of-characters](../problems/1032.stream-of-characters.md) 🆕
-- [1168.optimize-water-distribution-in-a-village](../problems/1168.optimize-water-distribution-in-a-village-cn.md) 🆕
-- [1449.form-largest-integer-with-digits-that-add-up-to-target](../problems/1449.form-largest-integer-with-digits-that-add-up-to-target.md) 🆕
+- [0004. 寻找两个正序数组的中位数](problems/4.median-of-two-sorted-arrays.md)
+- [0023. 合并K个升序链表](problems/23.merge-k-sorted-lists.md)
+- [0025. K 个一组翻转链表](problems/25.reverse-nodes-in-k-groups.md)
+- [0030. 串联所有单词的子串](problems/30.substring-with-concatenation-of-all-words.md)
+- [0032. 最长有效括号](problems/32.longest-valid-parentheses.md)
+- [0042. 接雨水](problems/42.trapping-rain-water.md)
+- [0052. N皇后 II](problems/52.N-Queens-II.md)
+- [0084. 柱状图中最大的矩形](problems/84.largest-rectangle-in-histogram.md)
+- [0085. 最大矩形](problems/85.maximal-rectangle.md)
+- [0124. 二叉树中的最大路径和](problems/124.binary-tree-maximum-path-sum.md)
+- [0128. 最长连续序列](problems/128.longest-consecutive-sequence.md)
+- [0145. 二叉树的后序遍历](problems/145.binary-tree-postorder-traversal.md)
+- [0212. 单词搜索 II](problems/212.word-search-ii.md)
+- [0239. 滑动窗口最大值](problems/239.sliding-window-maximum.md)
+- [0295. 数据流的中位数](problems/295.find-median-from-data-stream.md)
+- [0301. 删除无效的括号](problems/301.remove-invalid-parentheses.md)
+- [0312. 戳气球](problems/312.burst-balloons.md)
+- [0335. 路径交叉](problems/335.self-crossing.md)
+- [0460. LFU缓存](problems/460.lfu-cache.md)
+- [0472. 连接词](problems/472.concatenated-words.md)
+- [0488. 祖玛游戏](problems/488.zuma-game.md)
+- [0493. 翻转对](problems/493.reverse-pairs.md)
+- [0887. 鸡蛋掉落](problems/887.super-egg-drop.md)
+- [0895. 最大频率栈](problems/895.maximum-frequency-stack.md)
+- [1032. 字符流](problems/1032.stream-of-characters.md)
+- [1168. 水资源分配优化](problems/1168.optimize-water-distribution-in-a-village.md)
+- [1449. 数位成本和为目标值的最大数字](problems/1449.form-largest-integer-with-digits-that-add-up-to-target.md)