From 21e1305ad6da1ce1a27d965d332a52f50294e2ac Mon Sep 17 00:00:00 2001 From: ITCharge Date: Mon, 18 Sep 2023 18:04:06 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E7=AB=A0=E8=8A=82=E7=9B=AE?= =?UTF-8?q?=E5=BD=95=E9=93=BE=E6=8E=A5?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Contents/00.Introduction/index.md | 9 +++ Contents/01.Array/01.Array-Basic/index.md | 4 ++ Contents/01.Array/02.Array-Sort/index.md | 13 ++++ .../01.Array/03.Array-Binary-Search/index.md | 5 ++ .../01.Array/04.Array-Two-Pointers/index.md | 4 ++ .../01.Array/05.Array-Sliding-Window/index.md | 4 ++ Contents/01.Array/index.md | 36 +++++++++++ .../01.Linked-List-Basic/index.md | 4 ++ .../02.Linked-List-Sort/index.md | 4 ++ .../03.Linked-List-Two-Pointers/index.md | 4 ++ Contents/02.Linked-List/index.md | 17 +++++ Contents/03.Stack/01.Stack-Basic/index.md | 4 ++ Contents/03.Stack/02.Monotone-Stack/index.md | 4 ++ Contents/03.Stack/index.md | 11 ++++ Contents/04.Queue/01.Queue-Basic/index.md | 4 ++ Contents/04.Queue/02.Priority-Queue/index.md | 4 ++ Contents/04.Queue/index.md | 11 ++++ Contents/05.Hash-Table/index.md | 4 ++ Contents/06.String/01.String-Basic/index.md | 4 ++ .../index.md | 9 +++ .../03.String-Multi-Pattern-Matching/index.md | 8 +++ Contents/06.String/index.md | 25 ++++++++ Contents/07.Tree/01.Binary-Tree/index.md | 7 +++ .../07.Tree/02.Binary-Search-Tree/index.md | 5 ++ Contents/07.Tree/03.Segment-Tree/index.md | 4 ++ .../07.Tree/04.Binary-Indexed-Tree/index.md | 4 ++ Contents/07.Tree/05.Union-Find/index.md | 4 ++ Contents/07.Tree/index.md | 29 +++++++++ Contents/08.Graph/01.Graph-Basic/index.md | 4 ++ Contents/08.Graph/02.Graph-Traversal/index.md | 8 +++ .../08.Graph/03.Gaph-Spanning-Tree/index.md | 4 ++ .../08.Graph/04.Graph-Shortest-Path/index.md | 11 ++++ Contents/08.Graph/05.Graph-Bipartite/index.md | 8 +++ Contents/08.Graph/index.md | 41 ++++++++++++ .../01.Enumeration-Algorithm/index.md | 4 ++ .../02.Recursive-Algorithm/index.md | 4 ++ .../03.Divide-And-Conquer-Algorithm/index.md | 4 ++ .../04.Backtracking-Algorithm/index.md | 4 ++ .../05.Greedy-Algorithm/index.md | 4 ++ .../06.Bit-Operation/index.md | 4 ++ Contents/09.Algorithm-Base/index.md | 31 +++++++++ .../01.Dynamic-Programming-Basic/index.md | 4 ++ .../02.Memoization/index.md | 4 ++ .../03.Linear-DP/index.md | 5 ++ .../04.Knapsack-Problem/index.md | 8 +++ .../05.Interval-DP/index.md | 4 ++ .../06.Tree-DP/index.md | 4 ++ .../07.State-DP/index.md | 4 ++ .../08.Counting-DP/index.md | 4 ++ .../09.Digit-DP/index.md | 4 ++ .../10.Probability-DP/index.md | 4 ++ .../11.DP-Optimization/index.md | 6 ++ Contents/10.Dynamic-Programming/index.md | 63 +++++++++++++++++++ 53 files changed, 490 insertions(+) create mode 100644 Contents/00.Introduction/index.md create mode 100644 Contents/01.Array/01.Array-Basic/index.md create mode 100644 Contents/01.Array/02.Array-Sort/index.md create mode 100644 Contents/01.Array/03.Array-Binary-Search/index.md create mode 100644 Contents/01.Array/04.Array-Two-Pointers/index.md create mode 100644 Contents/01.Array/05.Array-Sliding-Window/index.md create mode 100644 Contents/01.Array/index.md create mode 100644 Contents/02.Linked-List/01.Linked-List-Basic/index.md create mode 100644 Contents/02.Linked-List/02.Linked-List-Sort/index.md create mode 100644 Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md create mode 100644 Contents/02.Linked-List/index.md create mode 100644 Contents/03.Stack/01.Stack-Basic/index.md create mode 100644 Contents/03.Stack/02.Monotone-Stack/index.md create mode 100644 Contents/03.Stack/index.md create mode 100644 Contents/04.Queue/01.Queue-Basic/index.md create mode 100644 Contents/04.Queue/02.Priority-Queue/index.md create mode 100644 Contents/04.Queue/index.md create mode 100644 Contents/05.Hash-Table/index.md create mode 100644 Contents/06.String/01.String-Basic/index.md create mode 100644 Contents/06.String/02.String-Single-Pattern-Matching/index.md create mode 100644 Contents/06.String/03.String-Multi-Pattern-Matching/index.md create mode 100644 Contents/06.String/index.md create mode 100644 Contents/07.Tree/01.Binary-Tree/index.md create mode 100644 Contents/07.Tree/02.Binary-Search-Tree/index.md create mode 100644 Contents/07.Tree/03.Segment-Tree/index.md create mode 100644 Contents/07.Tree/04.Binary-Indexed-Tree/index.md create mode 100644 Contents/07.Tree/05.Union-Find/index.md create mode 100644 Contents/07.Tree/index.md create mode 100644 Contents/08.Graph/01.Graph-Basic/index.md create mode 100644 Contents/08.Graph/02.Graph-Traversal/index.md create mode 100644 Contents/08.Graph/03.Gaph-Spanning-Tree/index.md create mode 100644 Contents/08.Graph/04.Graph-Shortest-Path/index.md create mode 100644 Contents/08.Graph/05.Graph-Bipartite/index.md create mode 100644 Contents/08.Graph/index.md create mode 100644 Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md create mode 100644 Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md create mode 100644 Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md create mode 100644 Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md create mode 100644 Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md create mode 100644 Contents/09.Algorithm-Base/06.Bit-Operation/index.md create mode 100644 Contents/09.Algorithm-Base/index.md create mode 100644 Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md create mode 100644 Contents/10.Dynamic-Programming/02.Memoization/index.md create mode 100644 Contents/10.Dynamic-Programming/03.Linear-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md create mode 100644 Contents/10.Dynamic-Programming/05.Interval-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/06.Tree-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/07.State-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/08.Counting-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/09.Digit-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/10.Probability-DP/index.md create mode 100644 Contents/10.Dynamic-Programming/11.DP-Optimization/index.md create mode 100644 Contents/10.Dynamic-Programming/index.md diff --git a/Contents/00.Introduction/index.md b/Contents/00.Introduction/index.md new file mode 100644 index 00000000..7acc1ae5 --- /dev/null +++ b/Contents/00.Introduction/index.md @@ -0,0 +1,9 @@ +## 本章内容 + +- [算法与数据结构](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/01.Data-Structures-Algorithms.md) +- [算法复杂度](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/02.Algorithm-Complexity.md) +- [LeetCode 入门与攻略](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/03.LeetCode-Guide.md) +- [LeetCode 题解（字典序排序，700+ 道题解）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/04.Solutions-List.md) +- [LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/05.Categories-List.md) +- [LeetCode 面试最常考 100 题（按分类排序）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/06.Interview-100-List.md) +- [LeetCode 面试最常考 200 题（按分类排序）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/00.Introduction/07.Interview-200-List.md) \ No newline at end of file diff --git a/Contents/01.Array/01.Array-Basic/index.md b/Contents/01.Array/01.Array-Basic/index.md new file mode 100644 index 00000000..ca7fa422 --- /dev/null +++ b/Contents/01.Array/01.Array-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [数组基础知识](./Contents/01.Array/01.Array-Basic/01.Array-Basic.md) +- [数组基础题目](./Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) \ No newline at end of file diff --git a/Contents/01.Array/02.Array-Sort/index.md b/Contents/01.Array/02.Array-Sort/index.md new file mode 100644 index 00000000..5042bb9a --- /dev/null +++ b/Contents/01.Array/02.Array-Sort/index.md @@ -0,0 +1,13 @@ +## 本章内容 + +- [冒泡排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) +- [选择排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md) +- [插入排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) +- [希尔排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md) +- [归并排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md) +- [快速排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md) +- [堆排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md) +- [计数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md) +- [桶排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) +- [基数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md) +- [数组排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) \ No newline at end of file diff --git a/Contents/01.Array/03.Array-Binary-Search/index.md b/Contents/01.Array/03.Array-Binary-Search/index.md new file mode 100644 index 00000000..5b261ffb --- /dev/null +++ b/Contents/01.Array/03.Array-Binary-Search/index.md @@ -0,0 +1,5 @@ +## 本章内容 + +- [二分查找知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) +- [二分查找知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) +- [二分查找题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) \ No newline at end of file diff --git a/Contents/01.Array/04.Array-Two-Pointers/index.md b/Contents/01.Array/04.Array-Two-Pointers/index.md new file mode 100644 index 00000000..a0f281c8 --- /dev/null +++ b/Contents/01.Array/04.Array-Two-Pointers/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [数组双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) +- [数组双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) \ No newline at end of file diff --git a/Contents/01.Array/05.Array-Sliding-Window/index.md b/Contents/01.Array/05.Array-Sliding-Window/index.md new file mode 100644 index 00000000..2d29fdfb --- /dev/null +++ b/Contents/01.Array/05.Array-Sliding-Window/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [数组滑动窗口知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) +- [数组滑动窗口题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) \ No newline at end of file diff --git a/Contents/01.Array/index.md b/Contents/01.Array/index.md new file mode 100644 index 00000000..35f35190 --- /dev/null +++ b/Contents/01.Array/index.md @@ -0,0 +1,36 @@ +## 本章内容 + +### 数组基础知识 + +- [数组基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/01.Array-Basic.md) +- [数组基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/02.Array-Basic-List.md) + +### 数组排序算法 + +- [冒泡排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/01.Array-Bubble-Sort.md) +- [选择排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/02.Array-Selection-Sort.md) +- [插入排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md) +- [希尔排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/04.Array-Shell-Sort.md) +- [归并排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/05.Array-Merge-Sort.md) +- [快速排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/06.Array-Quick-Sort.md) +- [堆排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/07.Array-Heap-Sort.md) +- [计数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/08.Array-Counting-Sort.md) +- [桶排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/09.Array-Bucket-Sort.md) +- [基数排序](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/10.Array-Radix-Sort.md) +- [数组排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/02.Array-Sort/11.Array-Sort-List.md) + +### 二分查找 + +- [二分查找知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/01.Array-Binary-Search-01.md) +- [二分查找知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/02.Array-Binary-Search-02.md) +- [二分查找题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/03.Array-Binary-Search/03.Array-Binary-Search-List.md) + +### 数组双指针 + +- [数组双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/01.Array-Two-Pointers.md) +- [数组双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/04.Array-Two-Pointers/02.Array-Two-Pointers-List.md) + +### 数组滑动窗口 + +- [数组滑动窗口知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md) +- [数组滑动窗口题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/01.Linked-List-Basic/index.md b/Contents/02.Linked-List/01.Linked-List-Basic/index.md new file mode 100644 index 00000000..c8f1269c --- /dev/null +++ b/Contents/02.Linked-List/01.Linked-List-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [链表基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) +- [链表经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/02.Linked-List-Sort/index.md b/Contents/02.Linked-List/02.Linked-List-Sort/index.md new file mode 100644 index 00000000..772df309 --- /dev/null +++ b/Contents/02.Linked-List/02.Linked-List-Sort/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [链表排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) +- [链表排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md b/Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md new file mode 100644 index 00000000..df50efdc --- /dev/null +++ b/Contents/02.Linked-List/03.Linked-List-Two-Pointers/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [链表双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) +- [链表双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) \ No newline at end of file diff --git a/Contents/02.Linked-List/index.md b/Contents/02.Linked-List/index.md new file mode 100644 index 00000000..880bf9a0 --- /dev/null +++ b/Contents/02.Linked-List/index.md @@ -0,0 +1,17 @@ +## 本章内容 + +### 链表基础知识 + +- [链表基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md) +- [链表经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/02.Linked-List-Basic-List.md) + +### 链表排序 + +- [链表排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/01.Linked-List-Sort.md) +- [链表排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/02.Linked-List-Sort/02.Linked-List-Sort-List.md) + +### 链表双指针 + +- [链表双指针知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md) +- [链表双指针题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md) + diff --git a/Contents/03.Stack/01.Stack-Basic/index.md b/Contents/03.Stack/01.Stack-Basic/index.md new file mode 100644 index 00000000..e5e04e07 --- /dev/null +++ b/Contents/03.Stack/01.Stack-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [堆栈基础知识](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/02.Stack-Basic-List.md) \ No newline at end of file diff --git a/Contents/03.Stack/02.Monotone-Stack/index.md b/Contents/03.Stack/02.Monotone-Stack/index.md new file mode 100644 index 00000000..58d7f5f6 --- /dev/null +++ b/Contents/03.Stack/02.Monotone-Stack/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [单调栈知识](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/02.Monotone-Stack-List.md) \ No newline at end of file diff --git a/Contents/03.Stack/index.md b/Contents/03.Stack/index.md new file mode 100644 index 00000000..f5426b4d --- /dev/null +++ b/Contents/03.Stack/index.md @@ -0,0 +1,11 @@ +## 本章内容 + +### 堆栈基础知识 + +- [堆栈基础知识](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/02.Stack-Basic-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/02.Monotone-Stack-List.md) \ No newline at end of file diff --git a/Contents/04.Queue/01.Queue-Basic/index.md b/Contents/04.Queue/01.Queue-Basic/index.md new file mode 100644 index 00000000..c6c1d365 --- /dev/null +++ b/Contents/04.Queue/01.Queue-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [队列基础知识](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/02.Queue-Basic-List.md) \ No newline at end of file diff --git a/Contents/04.Queue/02.Priority-Queue/index.md b/Contents/04.Queue/02.Priority-Queue/index.md new file mode 100644 index 00000000..9563cfb4 --- /dev/null +++ b/Contents/04.Queue/02.Priority-Queue/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [优先队列知识](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/02.Priority-Queue-List.md) \ No newline at end of file diff --git a/Contents/04.Queue/index.md b/Contents/04.Queue/index.md new file mode 100644 index 00000000..1f37c2e9 --- /dev/null +++ b/Contents/04.Queue/index.md @@ -0,0 +1,11 @@ +## 本章内容 + +### 队列基础知识 + +- [队列基础知识](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/02.Queue-Basic-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/02.Priority-Queue-List.md) \ No newline at end of file diff --git a/Contents/05.Hash-Table/index.md b/Contents/05.Hash-Table/index.md new file mode 100644 index 00000000..16278edc --- /dev/null +++ b/Contents/05.Hash-Table/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [哈希表知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/05.Hash-Table/01.Hash-Table.md) +- [哈希表题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/05.Hash-Table/02.Hash-Table-List.md) \ No newline at end of file diff --git a/Contents/06.String/01.String-Basic/index.md b/Contents/06.String/01.String-Basic/index.md new file mode 100644 index 00000000..784ecfdf --- /dev/null +++ b/Contents/06.String/01.String-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [字符串基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md) +- [字符串经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/02.String-Basic-List.md) \ No newline at end of file diff --git a/Contents/06.String/02.String-Single-Pattern-Matching/index.md b/Contents/06.String/02.String-Single-Pattern-Matching/index.md new file mode 100644 index 00000000..bc823dec --- /dev/null +++ b/Contents/06.String/02.String-Single-Pattern-Matching/index.md @@ -0,0 +1,9 @@ +## 本章内容 + +- [Brute Force 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) +- [Rabin Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) +- [KMP 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) +- [Boyer Moore 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) +- [Horspool 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) +- [Sunday 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) +- [单模式串匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) \ No newline at end of file diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/index.md b/Contents/06.String/03.String-Multi-Pattern-Matching/index.md new file mode 100644 index 00000000..60064500 --- /dev/null +++ b/Contents/06.String/03.String-Multi-Pattern-Matching/index.md @@ -0,0 +1,8 @@ +## 本章内容 + +- [字典树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md) +- [字典树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) +- [AC 自动机知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) +- [AC 自动机题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) +- [后缀数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) +- [后缀数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) \ No newline at end of file diff --git a/Contents/06.String/index.md b/Contents/06.String/index.md new file mode 100644 index 00000000..d931547d --- /dev/null +++ b/Contents/06.String/index.md @@ -0,0 +1,25 @@ +## 本章内容 + +### 字符串基础知识 + +- [字符串基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md) +- [字符串经典题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/02.String-Basic-List.md) + +### 单模式串匹配 + +- [Brute Force 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/01.String-Brute-Force.md) +- [Rabin Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/02.String-Rabin-Karp.md) +- [KMP 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/03.String-KMP.md) +- [Boyer Moore 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/04.String-Boyer-Moore.md) +- [Horspool 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/05.String-Horspool.md) +- [Sunday 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/06.String-Sunday.md) +- [单模式串匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/02.String-Single-Pattern-Matching/07.String-Single-Pattern-Matching-List.md) + +### 多模式串匹配 + +- [字典树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md) +- [字典树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/02.Trie-List.md) +- [AC 自动机知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/03.AC-Automaton.md) +- [AC 自动机题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md) +- [后缀数组知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md) +- [后缀数组题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/01.Binary-Tree/index.md b/Contents/07.Tree/01.Binary-Tree/index.md new file mode 100644 index 00000000..d962991b --- /dev/null +++ b/Contents/07.Tree/01.Binary-Tree/index.md @@ -0,0 +1,7 @@ +## 本章内容 + +- [树与二叉树基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) +- [二叉树的遍历知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) +- [二叉树的遍历题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) +- [二叉树的还原知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) +- [二叉树的还原题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/02.Binary-Search-Tree/index.md b/Contents/07.Tree/02.Binary-Search-Tree/index.md new file mode 100644 index 00000000..2f1c88f7 --- /dev/null +++ b/Contents/07.Tree/02.Binary-Search-Tree/index.md @@ -0,0 +1,5 @@ +## 本章内容 + +- [二叉搜索树知识](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/02.Binary-Search-Tree-List.md) + diff --git a/Contents/07.Tree/03.Segment-Tree/index.md b/Contents/07.Tree/03.Segment-Tree/index.md new file mode 100644 index 00000000..c0fe57d3 --- /dev/null +++ b/Contents/07.Tree/03.Segment-Tree/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [线段树知识](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/03.Segment-Tree/02.Segment-Tree-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/04.Binary-Indexed-Tree/index.md b/Contents/07.Tree/04.Binary-Indexed-Tree/index.md new file mode 100644 index 00000000..f80203d7 --- /dev/null +++ b/Contents/07.Tree/04.Binary-Indexed-Tree/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [树状数组知识](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/02.Binary-Indexed-Tree-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/05.Union-Find/index.md b/Contents/07.Tree/05.Union-Find/index.md new file mode 100644 index 00000000..9eba76ed --- /dev/null +++ b/Contents/07.Tree/05.Union-Find/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [并查集知识](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/02.Union-Find-List.md) \ No newline at end of file diff --git a/Contents/07.Tree/index.md b/Contents/07.Tree/index.md new file mode 100644 index 00000000..ae371747 --- /dev/null +++ b/Contents/07.Tree/index.md @@ -0,0 +1,29 @@ +## 本章内容 + +### 二叉树 + +- [树与二叉树基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md) +- [二叉树的遍历知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md) +- [二叉树的遍历题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/03.Binary-Tree-Traverse-List.md) +- [二叉树的还原知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/04.Binary-Tree-Reduction.md) +- [二叉树的还原题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/05.Binary-Tree-Reduction-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/02.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/03.Segment-Tree/02.Segment-Tree-List.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/02.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/02.Union-Find-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/01.Graph-Basic/index.md b/Contents/08.Graph/01.Graph-Basic/index.md new file mode 100644 index 00000000..03b14c94 --- /dev/null +++ b/Contents/08.Graph/01.Graph-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [图的定义和分类](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/01.Graph-Basic/02.Graph-Structure.md) \ No newline at end of file diff --git a/Contents/08.Graph/02.Graph-Traversal/index.md b/Contents/08.Graph/02.Graph-Traversal/index.md new file mode 100644 index 00000000..c404d4b6 --- /dev/null +++ b/Contents/08.Graph/02.Graph-Traversal/index.md @@ -0,0 +1,8 @@ +## 本章内容 + +- [图的深度优先搜索知识](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/02.Graph-DFS-List.md) +- [图的广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md) +- [图的广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) +- [图的拓扑排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) +- [图的拓扑排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/03.Gaph-Spanning-Tree/index.md b/Contents/08.Graph/03.Gaph-Spanning-Tree/index.md new file mode 100644 index 00000000..e64be217 --- /dev/null +++ b/Contents/08.Graph/03.Gaph-Spanning-Tree/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [图的最小生成树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/01.Gaph-Minimum-Spanning-Tree.md) +- [图的最小生成树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/02.Gaph-Minimum-Spanning-Tree-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/04.Graph-Shortest-Path/index.md b/Contents/08.Graph/04.Graph-Shortest-Path/index.md new file mode 100644 index 00000000..ed11ed6b --- /dev/null +++ b/Contents/08.Graph/04.Graph-Shortest-Path/index.md @@ -0,0 +1,11 @@ +## 本章内容 + +- [单源最短路径知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) +- [单源最短路径知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) +- [单源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) +- [多源最短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) +- [多源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) +- [次短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) +- [次短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) +- [差分约束系统知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) +- [差分约束系统题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/09.Graph-System-Of-Difference-Constraints-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/05.Graph-Bipartite/index.md b/Contents/08.Graph/05.Graph-Bipartite/index.md new file mode 100644 index 00000000..0cebef1e --- /dev/null +++ b/Contents/08.Graph/05.Graph-Bipartite/index.md @@ -0,0 +1,8 @@ +## 本章内容 + +- [二分图基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/01.Graph-Bipartite-Basic.md) +- [二分图基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) +- [二分图最大匹配知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) +- [匈牙利算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) +- [Hopcroft-Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) +- [二分图最大匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) \ No newline at end of file diff --git a/Contents/08.Graph/index.md b/Contents/08.Graph/index.md new file mode 100644 index 00000000..cb505087 --- /dev/null +++ b/Contents/08.Graph/index.md @@ -0,0 +1,41 @@ +## 本章内容 + +### 图的基础知识 + +- [图的定义和分类](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/01.Graph-Basic/02.Graph-Structure.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/02.Graph-DFS-List.md) +- [图的广度优先搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/03.Graph-BFS.md) +- [图的广度优先搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/04.Graph-BFS-List.md) +- [图的拓扑排序知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/05.Graph-Topological-Sorting.md) +- [图的拓扑排序题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/02.Graph-Traversal/06.Graph-Topological-Sorting-List.md) + +### 图的生成树 + +- [图的最小生成树知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/01.Gaph-Minimum-Spanning-Tree.md) +- [图的最小生成树题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/03.Gaph-Spanning-Tree/02.Gaph-Minimum-Spanning-Tree-List.md) + +### 最短路径 + +- [单源最短路径知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/01.Graph-Single-Source-Shortest-Path-01.md) +- [单源最短路径知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/02.Graph-Single-Source-Shortest-Path-02.md) +- [单源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/03.Graph-Single-Source-Shortest-Path-List.md) +- [多源最短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/04.Graph-Multi-Source-Shortest-Path.md) +- [多源最短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/05.Graph-Multi-Source-Shortest-Path-List.md) +- [次短路径知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/06.Graph-The-Second-Shortest-Path.md) +- [次短路径题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/07.Graph-The-Second-Shortest-Path-List.md) +- [差分约束系统知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/08.Graph-System-Of-Difference-Constraints.md) +- [差分约束系统题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/04.Graph-Shortest-Path/09.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.md) +- [二分图基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/02.Graph-Bipartite-Basic-List.md) +- [二分图最大匹配知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/03.Graph-Bipartite-Matching.md) +- [匈牙利算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/04.Graph-Hungarian-Algorithm.md) +- [Hopcroft-Karp 算法](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md) +- [二分图最大匹配题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md b/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md new file mode 100644 index 00000000..a6650a96 --- /dev/null +++ b/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [枚举算法知识](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/02.Enumeration-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md b/Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md new file mode 100644 index 00000000..3500d867 --- /dev/null +++ b/Contents/09.Algorithm-Base/02.Recursive-Algorithm/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [递归算法知识](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/02.Recursive-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md b/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md new file mode 100644 index 00000000..0cb593e7 --- /dev/null +++ b/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) +- [分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md b/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md new file mode 100644 index 00000000..6044c40a --- /dev/null +++ b/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) +- [回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md b/Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md new file mode 100644 index 00000000..c32ee657 --- /dev/null +++ b/Contents/09.Algorithm-Base/05.Greedy-Algorithm/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) +- [贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/06.Bit-Operation/index.md b/Contents/09.Algorithm-Base/06.Bit-Operation/index.md new file mode 100644 index 00000000..d28c1d38 --- /dev/null +++ b/Contents/09.Algorithm-Base/06.Bit-Operation/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [位运算知识](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/02.Bit-Operation-List.md) \ No newline at end of file diff --git a/Contents/09.Algorithm-Base/index.md b/Contents/09.Algorithm-Base/index.md new file mode 100644 index 00000000..46473ac8 --- /dev/null +++ b/Contents/09.Algorithm-Base/index.md @@ -0,0 +1,31 @@ +## 本章内容 + +### 枚举算法 + +- [枚举算法知识](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/02.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/02.Recursive-Algorithm-List.md) + +### 分治算法 + +- [分治算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/01.Divide-And-Conquer-Algorithm.md) +- [分治算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/03.Divide-And-Conquer-Algorithm/02.Divide-And-Conquer-Algorithm-List.md) + +### 回溯算法 + +- [回溯算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/01.Backtracking-Algorithm.md) +- [回溯算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/04.Backtracking-Algorithm/02.Backtracking-Algorithm-List.md) + +### 贪心算法 + +- [贪心算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/01.Greedy-Algorithm.md) +- [贪心算法题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/05.Greedy-Algorithm/02.Greedy-Algorithm-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/02.Bit-Operation-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md b/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md new file mode 100644 index 00000000..c1d518cb --- /dev/null +++ b/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [动态规划基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) +- [动态规划基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/02.Memoization/index.md b/Contents/10.Dynamic-Programming/02.Memoization/index.md new file mode 100644 index 00000000..8d8ac48e --- /dev/null +++ b/Contents/10.Dynamic-Programming/02.Memoization/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [记忆化搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) +- [记忆化搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/03.Linear-DP/index.md b/Contents/10.Dynamic-Programming/03.Linear-DP/index.md new file mode 100644 index 00000000..d5a94e0a --- /dev/null +++ b/Contents/10.Dynamic-Programming/03.Linear-DP/index.md @@ -0,0 +1,5 @@ +## 本章内容 + +- [线性 DP 知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) +- [线性 DP 知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) +- [线性 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md b/Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md new file mode 100644 index 00000000..f9e0e6ae --- /dev/null +++ b/Contents/10.Dynamic-Programming/04.Knapsack-Problem/index.md @@ -0,0 +1,8 @@ +## 本章内容 + +- [背包问题知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) +- [背包问题知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) +- [背包问题知识（三）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) +- [背包问题知识（四）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) +- [背包问题知识（五）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) +- [背包问题题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/05.Interval-DP/index.md b/Contents/10.Dynamic-Programming/05.Interval-DP/index.md new file mode 100644 index 00000000..0b639e35 --- /dev/null +++ b/Contents/10.Dynamic-Programming/05.Interval-DP/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [区间 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) +- [区间 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/06.Tree-DP/index.md b/Contents/10.Dynamic-Programming/06.Tree-DP/index.md new file mode 100644 index 00000000..1b72c8a4 --- /dev/null +++ b/Contents/10.Dynamic-Programming/06.Tree-DP/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [树形 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) +- [树形 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/07.State-DP/index.md b/Contents/10.Dynamic-Programming/07.State-DP/index.md new file mode 100644 index 00000000..d0d1ea87 --- /dev/null +++ b/Contents/10.Dynamic-Programming/07.State-DP/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [状态压缩 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) +- [状态压缩 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/08.Counting-DP/index.md b/Contents/10.Dynamic-Programming/08.Counting-DP/index.md new file mode 100644 index 00000000..d17520dc --- /dev/null +++ b/Contents/10.Dynamic-Programming/08.Counting-DP/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [计数 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) +- [计数 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/09.Digit-DP/index.md b/Contents/10.Dynamic-Programming/09.Digit-DP/index.md new file mode 100644 index 00000000..0b745e85 --- /dev/null +++ b/Contents/10.Dynamic-Programming/09.Digit-DP/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [数位 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) +- [数位 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/10.Probability-DP/index.md b/Contents/10.Dynamic-Programming/10.Probability-DP/index.md new file mode 100644 index 00000000..c719197e --- /dev/null +++ b/Contents/10.Dynamic-Programming/10.Probability-DP/index.md @@ -0,0 +1,4 @@ +## 本章内容 + +- [概率 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) +- [概率 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/11.DP-Optimization/index.md b/Contents/10.Dynamic-Programming/11.DP-Optimization/index.md new file mode 100644 index 00000000..3292fa8a --- /dev/null +++ b/Contents/10.Dynamic-Programming/11.DP-Optimization/index.md @@ -0,0 +1,6 @@ +## 本章内容 + +- [单调栈 / 优先队列优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) +- [斜率优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) +- [四边形不等式优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) +- [动态规划优化题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) \ No newline at end of file diff --git a/Contents/10.Dynamic-Programming/index.md b/Contents/10.Dynamic-Programming/index.md new file mode 100644 index 00000000..86a96ac0 --- /dev/null +++ b/Contents/10.Dynamic-Programming/index.md @@ -0,0 +1,63 @@ +## 本章内容 + +### 动态规划基础 + +- [动态规划基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md) +- [动态规划基础题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/02.Dynamic-Programming-Basic-List.md) + +### 记忆化搜索 + +- [记忆化搜索知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/01.Memoization.md) +- [记忆化搜索题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/02.Memoization/02.Memoization-List.md) + +### 线性 DP + +- [线性 DP 知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/01.Linear-DP-01.md) +- [线性 DP 知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/02.Linear-DP-02.md) +- [线性 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/03.Linear-DP/03.Linear-DP-List.md) + +### 背包问题 + +- [背包问题知识（一）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/01.Knapsack-Problem-01.md) +- [背包问题知识（二）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/02.Knapsack-Problem-02.md) +- [背包问题知识（三）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md) +- [背包问题知识（四）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/04.Knapsack-Problem-04.md) +- [背包问题知识（五）](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/05.Knapsack-Problem-05.md) +- [背包问题题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/04.Knapsack-Problem/06.Knapsack-Problem-List.md) + +### 区间 DP + +- [区间 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/01.Interval-DP.md) +- [区间 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/05.Interval-DP/02.Interval-DP-List.md) + +### 树形 DP + +- [树形 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/01.Tree-DP.md) +- [树形 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/06.Tree-DP/02.Tree-DP-List.md) + +### 状态压缩 DP + +- [状态压缩 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/01.State-DP.md) +- [状态压缩 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/07.State-DP/02.State-DP-List.md) + +### 计数 DP + +- [计数 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/01.Counting-DP.md) +- [计数 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/08.Counting-DP/02.Counting-DP-List.md) + +### 数位 DP + +- [数位 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/01.Digit-DP.md) +- [数位 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/09.Digit-DP/02.Digit-DP-List.md) + +### 概率 DP + +- [概率 DP 知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/01.Probability-DP.md) +- [概率 DP 题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/10.Probability-DP/02.Probability-DP-List.md) + +### 动态规划优化 + +- [单调栈 / 优先队列优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/01.Monotone-Stack-Queue-Optimization.md) +- [斜率优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/02.Slope-Optimization.md) +- [四边形不等式优化](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md) +- [动态规划优化题目](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md) \ No newline at end of file