Skip to content

Commit

Permalink
更新目录章节
Browse files Browse the repository at this point in the history
  • Loading branch information
@itcharge
itcharge committed Feb 22, 2022
1 parent 4c4ad03 commit de8b9a5
Show file tree
Hide file tree
Showing 40 changed files with 313 additions and 186 deletions.
26 changes: 12 additions & 14 deletions Assets/Origins/Categories-List.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -114,11 +114,7 @@

###### 0155. 最小栈、0020. 有效的括号、0227. 基本计算器 II、0739. 每日温度、剑指 Offer II 038. 每日温度、0150. 逆波兰表达式求值、0232. 用栈实现队列、0394. 字符串解码、0946. 验证栈序列、剑指 Offer 06. 从尾到头打印链表

### [深度优先搜索题目](../../Contents/03.Stack/02.Stack-DFS/10.Stack-DFS-List.md)

###### 0200. 岛屿数量、0133. 克隆图、0494. 目标和、0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0145. 二叉树的后序遍历、0589. N 叉树的前序遍历、0590. N 叉树的后序遍历、0841. 钥匙和房间、0129. 求根节点到叶节点数字之和、0323. 无向图中连通分量的数目、0684. 冗余连接、0802. 找到最终的安全状态、0785. 判断二分图、0886. 可能的二分法、0323. 无向图中连通分量的数目、0695. 岛屿的最大面积、0130. 被围绕的区域、0417. 太平洋大西洋水流问题、1020. 飞地的数量、1254. 统计封闭岛屿的数目、1034. 边框着色、剑指 Offer 13. 机器人的运动范围、0529. 扫雷游戏

### [单调栈](../../Contents/03.Stack/03.Monotone-Stack/10.Monotone-Stack-List.md)
### [单调栈](../../Contents/03.Stack/02.Monotone-Stack/10.Monotone-Stack-List.md)

###### 0739. 每日温度、0496. 下一个更大元素 I、0503. 下一个更大元素 II、0901. 股票价格跨度、0084. 柱状图中最大的矩形、0316. 去除重复字母、1081. 不同字符的最小子序列、0042. 接雨水

Expand All @@ -128,11 +124,7 @@

###### 0622. 设计循环队列、0346. 数据流中的移动平均值、0225. 用队列实现栈

### [广度优先搜索题目](../../Contents/04.Queue/02.Queue-BFS/10.Queue-BFS-List.md)

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

### [优先队列题目](../../Contents/04.Queue/03.Priority-Queue/10.Priority-Queue-List.md)
### [优先队列题目](../../Contents/04.Queue/02.Priority-Queue/10.Priority-Queue-List.md)

###### 0703. 数据流中的第 K 大元素、0347. 前 K 个高频元素、0451. 根据字符出现频率排序、0973. 最接近原点的 K 个点、1296. 划分数组为连续数字的集合、0239. 滑动窗口最大值、0295. 数据流的中位数、0023. 合并K个升序链表、0218. 天际线问题

Expand Down Expand Up @@ -182,6 +174,14 @@

## 08. 图论

### [深度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/10.Graph-DFS-List.md)

###### 0200. 岛屿数量、0133. 克隆图、0494. 目标和、0144. 二叉树的前序遍历、0094. 二叉树的中序遍历、0145. 二叉树的后序遍历、0589. N 叉树的前序遍历、0590. N 叉树的后序遍历、0841. 钥匙和房间、0129. 求根节点到叶节点数字之和、0323. 无向图中连通分量的数目、0684. 冗余连接、0802. 找到最终的安全状态、0785. 判断二分图、0886. 可能的二分法、0323. 无向图中连通分量的数目、0695. 岛屿的最大面积、0130. 被围绕的区域、0417. 太平洋大西洋水流问题、1020. 飞地的数量、1254. 统计封闭岛屿的数目、1034. 边框着色、剑指 Offer 13. 机器人的运动范围、0529. 扫雷游戏

### [广度优先搜索题目](../../Contents/08.Graph/02.Graph-Traversal/10.Graph-DFS-List.md)

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

## 09. 基础算法

### [枚举算法题目](../../Contents/09.Algorithm-Base/01.Enumeration-Algorithm/10.Enumeration-Algorithm-List.md)
Expand All @@ -204,10 +204,8 @@

###### 0004. 寻找两个正序数组的中位数、0023. 合并K个升序链表、0053. 最大子序和、0241. 为运算表达式设计优先级、0169. 多数元素、0050. Pow(x, n)

### 动态规划

### [位运算](../../Contents/09.Algorithm-Base/07.Bit-Operation/10.Bit-Operation-List.md)
### [位运算](../../Contents/09.Algorithm-Base/06.Bit-Operation/10.Bit-Operation-List.md)

###### 0504. 七进制数、0405. 数字转换为十六进制数、0190. 颠倒二进制位、0191. 位1的个数、0371. 两整数之和、0089. 格雷编码、0201. 数字范围按位与、0338. 比特位计数、0136. 只出现一次的数字、0137. 只出现一次的数字 II、260. 只出现一次的数字 III、1349. 参加考试的最大学生数、0645. 错误的集合

## 10. 动态规划
119 changes: 78 additions & 41 deletions Assets/Origins/README-Catalogue-List.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -52,24 +52,18 @@
- 堆栈基础知识
- [堆栈基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md)
- [堆栈基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/10.Stack-Basic-List.md)
- 堆栈和深度优先搜索
- [深度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Stack-DFS/01.Stack-DFS.md)
- [深度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Stack-DFS/10.Stack-DFS-List.md)
- 单调栈
- [单调栈知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/03.Monotone-Stack/01.Monotone-Stack.md)
- [单调栈题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/03.Monotone-Stack/10.Monotone-Stack-List.md)
- [单调栈知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/01.Monotone-Stack.md)
- [单调栈题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/02.Monotone-Stack/10.Monotone-Stack-List.md)

## 04. 队列

- 队列基础知识
- [队列基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md)
- [队列基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/10.Queue-Basic-List.md)
- 队列和广度优先搜索
- [广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Queue-BFS/01.Queue-BFS.md)
- [广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Queue-BFS/10.Queue-BFS-List.md)
- 优先队列
- [优先队列知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/03.Priority-Queue/01.Priority-Queue.md)
- [优先队列题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/03.Priority-Queue/10.Priority-Queue-List.md)
- [优先队列知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/01.Priority-Queue.md)
- [优先队列题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/02.Priority-Queue/10.Priority-Queue-List.md)

## 05. 哈希表

Expand All @@ -95,6 +89,7 @@
- [字典树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie/10.Trie-List.md)
- AC 自动机
- [AC 自动机知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.AC-Automaton/01.AC-Automaton.md)
- [AC 自动机题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.AC-Automaton/10.AC-Automaton-List.md)

## 07. 树

Expand All @@ -104,61 +99,103 @@
- [二叉树的遍历知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse/01.Binary-Tree-Traverse.md)
- [二叉树的遍历题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse/10.Binary-Tree-Traverse-List.md)
- 二叉树构造
- ~~[二叉树构造知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Construction/01.Binary-Tree-Construction.md)~~
- [二叉树构造知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Construction/01.Binary-Tree-Construction.md)
- [二叉树构造题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Construction/10.Binary-Tree-Construction-List.md)
- 二叉搜索树
- ~~[二叉搜索树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md)~~
- [二叉搜索树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/01.Binary-Search-Tree.md)
- [二叉搜索树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/02.Binary-Search-Tree/10.Binary-Search-Tree-List.md)
- 线段树
- [线段树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/03.Segment-Tree/01.Segment-Tree.md)
- 树状数组
- ~~[树状数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md)~~
- [树状数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/01.Binary-Indexed-Tree.md)
- [树状数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/04.Binary-Indexed-Tree/10.Binary-Indexed-Tree-List.md)
- 并查集
- ~~[并查集知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/01.Union-Find.md)~~
- [并查集知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/01.Union-Find.md)
- [并查集题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/05.Union-Find/10.Union-Find-List.md)

## 08. 图论

- ~~图论基础知识~~
- ~~拓扑排序~~
- ~~欧拉路径~~
- ~~哈密顿路径~~
- ~~生成树~~
- ~~最小生成树~~
- ~~次小生成树~~
- ~~最小树形图~~
- ~~单源最短路~~
- ~~多源最短路径~~
- ~~K 短路径~~
- ~~差分约束系统~~
- ~~强连通分量~~
- ~~双联通分量~~
- ~~LCA~~
- ~~二分图~~
- ~~网络流~~
- [图的基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md)
- 图的遍历

- 图的深度优先搜索
- [图的深度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/01.Graph-DFS.md)
- [图的深度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/10.Graph-DFS-List.md)
- 图的广度优先搜索
- [图的广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/02.Graph-BFS/01.Graph-BFS.md)
- [图的广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/02.Graph-BFS/10.Graph-BFS-List.md)
- 图的拓扑排序

- [图的拓扑排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Topological-Sorting/01.Graph-Topological-Sorting.md)
- [图的拓扑排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-Topological-Sorting/10.Graph-Topological-Sorting-List.md)

- 图的生成树
- [Prim 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/01.Graph-Prim.md)
- [Kruskal 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/02.Graph-Kruskal.md)
- [图的生成树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/10.Gaph-Spanning-Tree-List.md)


- 最短路径

- 单源最短路径

- [Dijkstra 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Single-Source-Shortest-Path/01.Graph-Dijkstra.md)
- [Bellman-Ford 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Single-Source-Shortest-Path/02.Graph-Bellman-Ford.md)
- [SPFA 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Single-Source-Shortest-Path/03.Graph-SPFA.md)
- [单源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Single-Source-Shortest-Path/10.Graph-Single-Source-Shortest-Path-List.md)

- 多源最短路径

- [Floyed 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Multi-Source-Shortest-Path/01.Graph-Floyed.md)
- [多源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Multi-Source-Shortest-Path/10.Graph-Multi-Source-Shortest-Path-List.md)

- 次短路径

- [次短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-The-Second-Shortest-Path/01.Graph-The-Second-Shortest-Path.md)
- [次短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Graph-The-Second-Shortest-Path/10.Graph-The-Second-Shortest-Path-List.md)

- 差分约束系统

- [差分约束系统知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-System-Of-Difference-Constraints/01.Graph-System-Of-Difference-Constraints.md)
- [差分约束系统题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-System-Of-Difference-Constraints/10.Graph-System-Of-Difference-Constraints-List.md)

- 二分图

- 二分图基础知识

- [二分图基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic/01.Graph-Bipartite-Basic.md)
- [二分图基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic/10.Graph-Bipartite-Basic-List.md)

- 二分图最大匹配

- [匈牙利算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Matching/01.Graph-Hungarian-Algorithm.md)
- [Hopcroft-Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Matching/02.Graph-Hopcroft-Karp.md)
- [二分图最大匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Matching/10.Graph-Bipartite-Matching-List.md)


## 09. 基础算法

- 枚举算法
- ~~[枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md)~~
- [枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md)
- [枚举算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/10.Enumeration-Algorithm-List.md)
- 递归算法
- ~~[递归算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md)~~
- [递归算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md)
- [递归算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/02.Recursive-Algorithm/10.Recursive-Algorithm-List.md)
- 回溯算法
- ~~[回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Backtracking-Algorithm/01.Backtracking-Algorithm.md)~~
- [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Backtracking-Algorithm/01.Backtracking-Algorithm.md)
- [回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Backtracking-Algorithm/10.Backtracking-Algorithm-List.md)
- 贪心算法
- ~~[贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Greedy-Algorithm/01.Greedy-Algorithm.md)~~
- [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Greedy-Algorithm/01.Greedy-Algorithm.md)
- [贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Greedy-Algorithm/10.Greedy-Algorithm-List.md)
- 分治算法
- ~~[分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md)~~
- [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md)
- [分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Divide-And-Conquer-Algorithm/10.Divide-And-Conquer-Algorithm-List.md)
- 动态规划
- ~~[动态规划知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Dynamic-Programming/01.Dynamic-Programming.md)~~
- [动态规划题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Dynamic-Programming/10.Dynamic-Programming-List.md)
- 位运算
- ~~[位运算知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/07.Bit-Operation/01.Bit-Operation.md)~~
- [位运算题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/07.Bit-Operation/10.Bit-Operation-List.md)
- [位运算知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md)
- [位运算题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/06.Bit-Operation/10.Bit-Operation-List.md)

## 10. 动态规划

- [动态规划知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming.md)
- [动态规划题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Dynamic-Programming-List.md)

Loading

0 comments on commit de8b9a5

Please sign in to comment.