Skip to content

Commit

Permalink
更新题解分类列表
Browse files Browse the repository at this point in the history
  • Loading branch information
@itcharge
itcharge committed Feb 28, 2022
1 parent d45cbe9 commit 53a34a7
Show file tree
Hide file tree
Showing 13 changed files with 188 additions and 8 deletions.
40 changes: 37 additions & 3 deletions Assets/Origins/Categories-List.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -160,13 +160,15 @@

### [二叉搜索树题目](../../Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md)

###### 0098. 验证二叉搜索树、0173. 二叉搜索树迭代器、0700. 二叉搜索树中的搜索、0701. 二叉搜索树中的插入操作、0450. 删除二叉搜索树中的节点、0703. 数据流中的第 K 大元素、0235. 二叉搜索树的最近公共祖先、剑指 Offer 68 - I. 二叉搜索树的最近公共祖先、0110. 平衡二叉树、剑指 Offer 55 - II. 平衡二叉树、0108. 将有序数组转换为二叉搜索树
###### 0098. 验证二叉搜索树、0173. 二叉搜索树迭代器、0700. 二叉搜索树中的搜索、0701. 二叉搜索树中的插入操作、0450. 删除二叉搜索树中的节点、0703. 数据流中的第 K 大元素、0235. 二叉搜索树的最近公共祖先、0110. 平衡二叉树、0108. 将有序数组转换为二叉搜索树

### 线段树
### [线段树题目](../../Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md)

###### 0303. 区域和检索 - 数组不可变、0307. 区域和检索 - 数组可修改、1109. 航班预订统计、1893. 检查是否区域内所有整数都被覆盖、0354. 俄罗斯套娃信封问题、0673. 最长递增子序列的个数、1310. 子数组异或查询、1893. 检查是否区域内所有整数都被覆盖

### [树状数组题目](../../Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md)

###### 0315. 计算右侧小于当前元素的个数
###### 0303. 区域和检索 - 数组不可变、0307. 区域和检索 - 数组可修改、0315. 计算右侧小于当前元素的个数、0354. 俄罗斯套娃信封问题、0673. 最长递增子序列的个数、1310. 子数组异或查询、1893. 检查是否区域内所有整数都被覆盖

### [并查集题目](../../Contents/07.Tree/05.Union-Find/02.Union-Find-List.md)

Expand All @@ -182,6 +184,38 @@

###### 0286. 墙与门、0200. 岛屿数量、0752. 打开转盘锁、0279. 完全平方数、0133. 克隆图、0733. 图像渲染、0542. 01 矩阵、0322. 零钱兑换、0207. 课程表、0210. 课程表 II、1136. 平行课程、0323. 无向图中连通分量的数目、剑指 Offer 13. 机器人的运动范围

### [图的拓扑排序题目](../../Contents/08.Graph/02.Graph-Traversal/03.Graph-Topological-Sorting/02.Graph-Topological-Sorting-List.md)

###### 0802. 找到最终的安全状态、0851. 喧闹和富有

### [图的生成树题目](../../Contents/08.Graph/03.Gaph-Spanning-Tree/03.Gaph-Spanning-Tree-List.md)

###### 1631. 最小体力消耗路径、0778. 水位上升的泳池中游泳

### [单源最短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path/04.Graph-Single-Source-Shortest-Path-List.md)

###### 0407. 接雨水 II、0743. 网络延迟时间、0787. K 站中转内最便宜的航班、1631. 最小体力消耗路径、1786. 从第一个节点出发到最后一个节点的受限路径数

### [多源最短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Multi-Source-Shortest-Path/02.Graph-Multi-Source-Shortest-Path-List.md)

###### 0815. 公交路线、1162. 地图分析

### [次短路径题目](../../Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-The-Second-Shortest-Path/02.Graph-The-Second-Shortest-Path-List.md)

###### 2045. 到达目的地的第二短时间

### [差分约束系统](../../Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-System-Of-Difference-Constraints/02.Graph-System-Of-Difference-Constraints-List.md)

###### 0995. K 连续位的最小翻转次数、1109. 航班预订统计

### [二分图基础题目](../../Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic/02.Graph-Bipartite-Basic-List.md)

###### 0785. 判断二分图

### [二分图最大匹配题目](../../Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Matching/03.Graph-Bipartite-Matching-List.md)

###### LCP 04. 覆盖、1947. 最大兼容性评分和

## 09. 基础算法

### [枚举算法题目](../../Contents/09.Algorithm-Base/01.Enumeration-Algorithm/02.Enumeration-Algorithm-List.md)
Expand Down
78 changes: 75 additions & 3 deletions Contents/00.Introduction/05.Categories-List.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -453,18 +453,33 @@
| 0450 | [删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 树 | 中等 |
| 0703 | [数据流中的第 K 大元素](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 |
| 0235 | [二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0235.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树 | 简单 |
| 剑指 Offer 68 - I | [二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2068%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 |
| 0110 | [平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、递归 | 简单 |
| 剑指 Offer 55 - II | [平衡二叉树](https://leetcode-cn.com/problems/ping-heng-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2055%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 |
| 0108 | [将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0108.%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索 | 简单 |

### 线段树
### 线段树题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0303 | 区域和检索 - 数组不可变 | | | |
| 0307 | 区域和检索 - 数组可修改 | | | |
| 1109 | 航班预订统计 | | | |
| 1893 | 检查是否区域内所有整数都被覆盖 | | | |
| 0354 | [俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 动态规划、二分查找 | 困难 |
| 0673 | [最长递增子序列的个数](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 动态规划 | 中等 |
| 1310 | 子数组异或查询 | | | |
| 1893 | 检查是否区域内所有整数都被覆盖 | | | |

### 树状数组题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0303 | 区域和检索 - 数组不可变 | | | |
| 0307 | 区域和检索 - 数组可修改 | | | |
| 0315 | [计算右侧小于当前元素的个数](https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 |
| 0354 | [俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 动态规划、二分查找 | 困难 |
| 0673 | [最长递增子序列的个数](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 动态规划 | 中等 |
| 1310 | 子数组异或查询 | | | |
| 1893 | 检查是否区域内所有整数都被覆盖 | | | |

### 并查集题目

Expand Down Expand Up @@ -533,6 +548,63 @@
| 0323 | [无向图中连通分量的数目](https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0323.%20%E6%97%A0%E5%90%91%E5%9B%BE%E4%B8%AD%E8%BF%9E%E9%80%9A%E5%88%86%E9%87%8F%E7%9A%84%E6%95%B0%E7%9B%AE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 |
| 剑指 Offer 13 | [机器人的运动范围](https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2013.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4.md) | 深度优先搜索、广度优先搜索、动态规划 | 中等 |

### 图的拓扑排序题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0802 | [找到最终的安全状态](https://leetcode-cn.com/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 |
| 0851 | 喧闹和富有 | | | |

### 图的生成树题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 1631 | [最小体力消耗路径](https://leetcode-cn.com/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 |
| 0778 | [水位上升的泳池中游泳](https://leetcode-cn.com/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 |

### 单源最短路径题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0407 | 接雨水 II | | | |
| 0743 | 网络延迟时间 | | | |
| 0787 | K 站中转内最便宜的航班 | | | |
| 1631 | [最小体力消耗路径](https://leetcode-cn.com/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 |
| 1786 | 从第一个节点出发到最后一个节点的受限路径数 | | | |

### 多源最短路径题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0815 | 公交路线 | | | |
| 1162 | 地图分析 | | | |

### 次短路径题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 2045 | 到达目的地的第二短时间 | | | |

### 差分约束系统

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0995 | [K 连续位的最小翻转次数](https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0995.%20K%20%E8%BF%9E%E7%BB%AD%E4%BD%8D%E7%9A%84%E6%9C%80%E5%B0%8F%E7%BF%BB%E8%BD%AC%E6%AC%A1%E6%95%B0.md) | 位运算、数组、前缀和、滑动窗口 | 困难 |
| 1109 | 航班预订统计 | | | |

### 二分图基础题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0785 | [判断二分图](https://leetcode-cn.com/problems/is-graph-bipartite/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0785.%20%E5%88%A4%E6%96%AD%E4%BA%8C%E5%88%86%E5%9B%BE.md) | 深度优先搜索、广度优先搜索、并查集、图 | 中等 |

### 二分图最大匹配题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 04 | 覆盖 | | | |
| 1947 | 最大兼容性评分和 | | | |

## 09. 基础算法

### 枚举算法题目
Expand Down
2 changes: 0 additions & 2 deletions Contents/07.Tree/02.Binary-Search-Tree/02.Binary-Search-Tree-List.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -9,8 +9,6 @@
| 0450 | [删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0450.%20%E5%88%A0%E9%99%A4%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%9A%84%E8%8A%82%E7%82%B9.md) | 树 | 中等 |
| 0703 | [数据流中的第 K 大元素](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0703.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E7%AC%AC%20K%20%E5%A4%A7%E5%85%83%E7%B4%A0.md) | 树、设计、二叉搜索树、二叉树、数据流、堆（优先队列） | 简单 |
| 0235 | [二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0235.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树 | 简单 |
| 剑指 Offer 68 - I | [二叉搜索树的最近公共祖先](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2068%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88.md) | 树、深度优先搜索、二叉搜索树、二叉树 | 简单 |
| 0110 | [平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0110.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、递归 | 简单 |
| 剑指 Offer 55 - II | [平衡二叉树](https://leetcode-cn.com/problems/ping-heng-er-cha-shu-lcof/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/%E5%89%91%E6%8C%87%20Offer%2055%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91.md) | 树、深度优先搜索、二叉树 | 简单 |
| 0108 | [将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0108.%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.md) | 树、深度优先搜索 | 简单 |

13 changes: 13 additions & 0 deletions Contents/07.Tree/03.Segment-Tree/02.Segment-Tree-List.md
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
### 线段树题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0303 | 区域和检索 - 数组不可变 | | | |
| 0307 | 区域和检索 - 数组可修改 | | | |
| 1109 | 航班预订统计 | | | |
| 1893 | 检查是否区域内所有整数都被覆盖 | | | |
| 0354 | [俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 动态规划、二分查找 | 困难 |
| 0673 | [最长递增子序列的个数](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 动态规划 | 中等 |
| 1310 | 子数组异或查询 | | | |
| 1893 | 检查是否区域内所有整数都被覆盖 | | | |

6 changes: 6 additions & 0 deletions Contents/07.Tree/04.Binary-Indexed-Tree/02.Binary-Indexed-Tree-List.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,5 +2,11 @@

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0303 | 区域和检索 - 数组不可变 | | | |
| 0307 | 区域和检索 - 数组可修改 | | | |
| 0315 | [计算右侧小于当前元素的个数](https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0315.%20%E8%AE%A1%E7%AE%97%E5%8F%B3%E4%BE%A7%E5%B0%8F%E4%BA%8E%E5%BD%93%E5%89%8D%E5%85%83%E7%B4%A0%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 | 困难 |
| 0354 | [俄罗斯套娃信封问题](https://leetcode-cn.com/problems/russian-doll-envelopes/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0354.%20%E4%BF%84%E7%BD%97%E6%96%AF%E5%A5%97%E5%A8%83%E4%BF%A1%E5%B0%81%E9%97%AE%E9%A2%98.md) | 动态规划、二分查找 | 困难 |
| 0673 | [最长递增子序列的个数](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0673.%20%E6%9C%80%E9%95%BF%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E4%B8%AA%E6%95%B0.md) | 动态规划 | 中等 |
| 1310 | 子数组异或查询 | | | |
| 1893 | 检查是否区域内所有整数都被覆盖 | | | |

7 changes: 7 additions & 0 deletions ...aph-Traversal/03.Graph-Topological-Sorting/02.Graph-Topological-Sorting-List.md
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
### 图的拓扑排序题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 0802 | [找到最终的安全状态](https://leetcode-cn.com/problems/find-eventual-safe-states/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0802.%20%E6%89%BE%E5%88%B0%E6%9C%80%E7%BB%88%E7%9A%84%E5%AE%89%E5%85%A8%E7%8A%B6%E6%80%81.md) | 深度优先搜索、广度优先搜索、图、拓扑排序 | 中等 |
| 0851 | 喧闹和富有 | | | |

7 changes: 7 additions & 0 deletions Contents/08.Graph/03.Gaph-Spanning-Tree/03.Gaph-Spanning-Tree-List.md
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
### 图的生成树题目

| 题号 | 标题 | 题解 | 标签 | 难度 |
| :------ | :------ | :------ | :------ | :------ |
| 1631 | [最小体力消耗路径](https://leetcode-cn.com/problems/path-with-minimum-effort/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/1631.%20%E6%9C%80%E5%B0%8F%E4%BD%93%E5%8A%9B%E6%B6%88%E8%80%97%E8%B7%AF%E5%BE%84.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 中等 |
| 0778 | [水位上升的泳池中游泳](https://leetcode-cn.com/problems/swim-in-rising-water/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0778.%20%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3.md) | 深度优先搜索、广度优先搜索、并查集、数组、二分查找、矩阵、堆（优先队列） | 困难 |

Loading

0 comments on commit 53a34a7

Please sign in to comment.