更新题解列表

jieLinXuan · Jun 9, 2022 · fb56e84 · fb56e84
1 parent d23e597
commit fb56e84
Show file tree

Hide file tree

Showing 5 changed files with 309 additions and 4 deletions.
diff --git a/Assets/Origins/Interview-100-List.md b/Assets/Origins/Interview-100-List.md
@@ -0,0 +1,304 @@
+## 01. 数组
+
+### [数组基础题目](../../Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md)
+
+#### 数组操作题目
+
+###### 
+
+#### 二维数组题目
+
+###### 
+
+### [排序算法题目](../../Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md)
+
+#### 冒泡排序题目
+
+###### 
+
+#### 选择排序题目
+
+###### 0215. 数组中的第K个最大元素
+
+#### 插入排序题目
+
+###### 0075. 颜色分类
+
+#### 希尔排序题目
+
+###### 0912. 排序数组
+
+#### 归并排序题目
+
+###### 0912. 排序数组
+
+#### 快速排序题目
+
+###### 0912. 排序数组
+
+#### 堆排序题目
+
+###### 0912. 排序数组、0215. 数组中的第K个最大元素
+
+#### 计数排序题目
+
+###### 0912. 排序数组
+
+#### 桶排序题目
+
+###### 0912. 排序数组
+
+#### 基数排序题目
+
+###### 0164. 最大间距
+
+
+### [二分查找题目](../../Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-List.md)
+
+#### 二分下标题目
+
+###### 
+
+#### 二分答案题目
+
+###### 
+
+#### 复杂的二分查找问题
+
+###### 
+
+### [双指针题目](../../Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md)
+
+#### 对撞指针题目
+
+###### 
+
+#### 快慢指针题目
+
+###### 
+
+#### 分离双指针题目
+
+###### 
+
+### [滑动窗口题目](../../Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md)
+
+#### 固定长度窗口题目
+
+###### 
+
+#### 不定长度窗口题目
+
+###### 0003. 无重复字符的最长子串、
+
+## 02. 链表
+
+### [链表经典题目](../../Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md)
+
+###### 0206. 反转链表
+
+### [链表排序题目](../../Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md)
+
+###### 
+
+### [链表双指针题目](../../Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md)
+
+###### 
+
+## 03. 堆栈
+
+### [堆栈基础题目](../../Contents/03.Stack/01.Stack-Basic/02.Stack-Basic-List.md)
+
+###### 
+
+### [单调栈](../../Contents/03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md)
+
+###### 
+
+## 04. 队列
+
+### [队列基础题目](../../Contents/04.Queue/01.Queue-Basic/02.Queue-Basic-List.md)
+
+###### 
+
+### [优先队列题目](../../Contents/04.Queue/02.Priority-Queue/02.Priority-Queue-List.md)
+
+###### 
+
+## 05. 哈希表
+
+### [哈希表题目](../../Contents/05.Hash-Table/02.Hash-Table-List.md)
+
+###### 
+
+## 06. 字符串
+
+### [字符串基础题目](../../Contents/06.String/01.String-Basic/02.String-Basic-List.md)
+
+###### 0003. 无重复字符的最长子串
+
+### [单模式串匹配题目](../../Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md)
+
+###### 
+
+### [字典树题目](../../Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md)
+
+###### 
+
+## 07. 树
+
+### [二叉树的遍历题目](../../Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md)
+
+###### 
+
+### [二叉树的还原题目](../../Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md)
+
+###### 
+
+### [二叉搜索树题目](../../Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md)
+
+###### 
+
+### [线段树题目](../../Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md)
+
+#### 单点更新题目
+
+###### 
+
+#### 区间更新题目
+
+###### 
+
+#### 区间合并题目
+
+###### 
+
+#### 扫描线问题
+
+###### 
+
+### [树状数组题目](../../Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md)
+
+###### 
+
+### [并查集题目](../../Contents/07.Tree/05.Union-Find/02.Union-Find-List.md)
+
+###### 
+
+## 08. 图论
+
+### [图的深度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/02.Graph-DFS-List.md)
+
+###### 
+
+### [图的广度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md)
+
+###### 
+
+### [图的拓扑排序题目](../../Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md)
+
+###### 
+
+### [图的生成树题目](../../Contents/08.Graph/03.Gaph-Spanning-Tree/04.Gaph-Spanning-Tree-List.md)
+
+###### 
+
+### [单源最短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Single-Source-Shortest-Path-List.md)
+
+###### 
+
+### [多源最短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-Multi-Source-Shortest-Path-List.md)
+
+###### 
+
+### [次短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/10.Graph-The-Second-Shortest-Path-List.md)
+
+###### 
+
+### [差分约束系统](../../Contents/08.Graph/04.Graph-Shortest-Path/12.Graph-System-Of-Difference-Constraints-List.md)
+
+###### 
+
+### [二分图基础题目](../../Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md)
+
+###### 
+
+### [二分图最大匹配题目](../../Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md)
+
+###### 
+
+## 09. 基础算法
+
+### [枚举算法题目](../../Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md)
+
+###### 
+
+### [递归算法题目](../../Contents/09.Algorithm-Base/02.Recursive-Algorithm/02.Recursive-Algorithm-List.md)
+
+###### 0206. 反转链表
+
+### [分治算法题目](../../Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md)
+
+###### 
+
+### [回溯算法题目](../../Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md)
+
+###### 
+
+### [贪心算法题目](../../Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md)
+
+###### 
+
+### [位运算题目](../../Contents/09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md)
+
+###### 
+
+## 10. 动态规划
+
+### [动态规划基础题目](../../Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md)
+
+###### 
+
+### [记忆化搜索题目](../../Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md)
+
+###### 
+
+### [背包问题题目](../../Contents/10.Dynamic-Programming/03.Knapsack-Problem/02.Knapsack-Problem-List.md)
+
+###### 
+
+### [线性 DP 题目](../../Contents/10.Dynamic-Programming/04.Linear-DP/02.Linear-DP-List.md)
+
+###### 
+
+### [区间 DP 题目](../../Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md)
+
+###### 
+
+### [树形 DP 题目](../../Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md)
+
+### [数位 DP 题目](../../Contents/10.Dynamic-Programming/07.Number-DP/02.Number-DP-List.md)
+
+###### 
+
+### [状态压缩 DP 题目](../../Contents/10.Dynamic-Programming/08.State-DP/02.State-DP-List.md)
+
+###### 
+
+### [概率 DP 题目](../../Contents/10.Dynamic-Programming/09.Probability-DP/02.Probability-DP-List.md)
+
+######
+
+### [计数 DP 题目](../../Contents/10.Dynamic-Programming/10.Count-DP/10.Count-DP-List.md)
+
+### [动态规划优化题目](../../Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md)
+
+
+
+
+
+
+###### 0025. K 个一组翻转链表、0015. 三数之和、0912. 排序数组、0053. 最大子序和、0021. 合并两个有序链表、0001. 两数之和、0102. 二叉树的层序遍历、0121. 买卖股票的最佳时机、0020. 有效的括号、0141. 环形链表、0103. 二叉树的锯齿形层次遍历、0033. 搜索旋转排序数组、0236. 二叉树的最近公共祖先、0088. 合并两个有序数组、0005. 最长回文子串、0160. 相交链表、0200. 岛屿数量、0046. 全排列、0023. 合并K个排序链表、0415. 字符串相加、0142. 环形链表 II、0054. 螺旋矩阵、0092. 反转链表 II、0300. 最长上升子序列、0042. 接雨水、0143. 重排链表、0124. 二叉树中的最大路径和、0704. 二分查找、094. 二叉树的中序遍历、0232. 用栈实现队列、0199. 二叉树的右视图、0056. 合并区间、0019. 删除链表的倒数第N个节点、0070. 爬楼梯、0004. 寻找两个正序数组的中位数、0148. 排序链表、0072. 编辑距离、0082. 删除排序链表中的重复元素 II、0069. x 的平方根、0002. 两数相加、剑指 Offer 22. 链表中倒数第k个节点、0008. 字符串转换整数 (atoi)、0041. 缺失的第一个正数、0022. 括号生成、0031. 下一个排列、1143. 最长公共子序列、0093. 复原IP地址、0151. 翻转字符串里的单词、0144. 二叉树的前序遍历、0105. 从前序与中序遍历序列构造二叉树、0239. 滑动窗口最大值、076. 最小覆盖子串、0129. 求根到叶子节点数字之和、0104. 二叉树的最大深度、0110. 平衡二叉树、0155. 最小栈、0322. 零钱兑换、0032. 最长有效括号、0043. 字符串相乘、0098. 验证二叉搜索树、0113. 路径总和 II、0543. 二叉树的直径、0101. 对称二叉树、0165. 比较版本号、0064. 最小路径和、0078. 子集、0470. 用 Rand7() 实现 Rand10()、0234. 回文链表、0169. 多数元素、0048. 旋转图像、0112. 路径总和、0039. 组合总和、0718. 最长重复子数组、0034. 在排序数组中查找元素的第一个和最后一个位置、0226. 翻转二叉树、0014. 最长公共前缀、0221. 最大正方形、0240. 搜索二维矩阵 II、0162. 寻找峰值、0062. 不同路径、0083. 删除排序链表中的重复元素、0128. 最长连续序列、0695. 岛屿的最大面积、0394. 字符串解码、0153. 寻找旋转排序数组中的最小值、0152. 乘积最大子数组、0662. 二叉树最大宽度、0227. 基本计算器 II、0122. 买卖股票的最佳时机 II、0024. 两两交换链表中的节点、00198. 打家劫舍、0179. 最大数、0136. 只出现一次的数字、0468. 验证IP地址、0138. 复制带随机指针的链表
+
+### 待加入
+###### 0146. LRU缓存机制
diff --git a/Contents/00.Introduction/04.Solutions-List.md b/Contents/00.Introduction/04.Solutions-List.md
@@ -1,4 +1,4 @@
-# LeetCode 题解（已完成 707 道）
+# LeetCode 题解（已完成 708 道）
 
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------ | :------ | :------ | :------ | :------ |
@@ -246,6 +246,7 @@
 | 0386 | [字典序排数](https://leetcode.cn/problems/lexicographical-numbers/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0386.%20%E5%AD%97%E5%85%B8%E5%BA%8F%E6%8E%92%E6%95%B0.md) | 深度优先搜索、字典树 | 中等 |
 | 0387 | [字符串中的第一个唯一字符](https://leetcode.cn/problems/first-unique-character-in-a-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0387.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E4%B8%AD%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%94%AF%E4%B8%80%E5%AD%97%E7%AC%A6.md) | 字符串、哈希表 | 简单 |
 | 0389 | [找不同](https://leetcode.cn/problems/find-the-difference/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0389.%20%E6%89%BE%E4%B8%8D%E5%90%8C.md) | 位运算、哈希表 | 简单 |
+| 0391 | [完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md) | 数组、扫描线 | 困难 |
 | 0392 | [判断子序列](https://leetcode.cn/problems/is-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0392.%20%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.md) | 双指针、字符串、动态规划 | 简单 |
 | 0394 | [字符串解码](https://leetcode.cn/problems/decode-string/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81.md) | 栈、深度优先搜索 | 中等 |
 | 0395 | [至少有 K 个重复字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-least-k-repeating-characters/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0395.%20%E8%87%B3%E5%B0%91%E6%9C%89%20K%20%E4%B8%AA%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md) | 哈希表、字符串、分治、滑动窗口 | 中等 |

diff --git a/Contents/00.Introduction/05.Categories-List.md b/Contents/00.Introduction/05.Categories-List.md
@@ -489,7 +489,7 @@
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------ | :------ | :------ | :------ | :------ |
 | 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) |  树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 |
-| 0391 | 完美矩形 |   |   |   |
+| 0391 | [完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md) | 数组、扫描线 | 困难 |
 | 0850 | 矩形面积 II |   |   |   |
 
 ### 树状数组题目

diff --git a/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md b/Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md
@@ -32,6 +32,6 @@
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------ | :------ | :------ | :------ | :------ |
 | 0218 | [天际线问题](https://leetcode.cn/problems/the-skyline-problem/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0218.%20%E5%A4%A9%E9%99%85%E7%BA%BF%E9%97%AE%E9%A2%98.md) |  树状数组、线段树、数组、分治、有序集合、扫描线、堆（优先队列） | 困难 |
-| 0391 | 完美矩形 |   |   |   |
+| 0391 | [完美矩形](https://leetcode.cn/problems/perfect-rectangle/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0391.%20%E5%AE%8C%E7%BE%8E%E7%9F%A9%E5%BD%A2.md) | 数组、扫描线 | 困难 |
 | 0850 | 矩形面积 II |   |   |   |
 
diff --git a/README.md b/README.md
@@ -252,4 +252,4 @@
   - [动态规划优化题目](./Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md)
 
 ## 11. 附加内容
-## [12. LeetCode 题解（已完成 707 道）](./Contents/00.Introduction/04.Solutions-List.md)
+## [12. LeetCode 题解（已完成 708 道）](./Contents/00.Introduction/04.Solutions-List.md)