更改项目说明

itcharge · May 9, 2024 · 24fb09a · 24fb09a
1 parent cc3adb0
commit 24fb09a
Show file tree

Hide file tree

Showing 6 changed files with 49 additions and 43 deletions.
diff --git a/Assets/Origins/README-Catalogue-List.md b/Assets/Origins/README-Catalogue-List.md
@@ -1,16 +1,14 @@
-# 内容章节
-
-## 00. 绪论
+### 00. 绪论
 
 - [算法与数据结构](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 题解（字典序排序，850+ 道题解）](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)
 
-## 01. 数组
+### 01. 数组
 
 - 数组基础知识
   - [数组基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/01.Array/01.Array-Basic/01.Array-Basic.md)
@@ -38,7 +36,7 @@
   - [数组滑动窗口知识](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)
 
-## 02. 链表
+### 02. 链表
 
 - 链表基础知识
   - [链表基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md)
@@ -50,7 +48,7 @@
   - [链表双指针知识](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)
 
-## 03. 堆栈
+### 03. 堆栈
 
 - 堆栈基础知识
   - [堆栈基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/03.Stack/01.Stack-Basic/01.Stack-Basic.md)
@@ -59,7 +57,7 @@
   - [单调栈知识](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)
 
-## 04. 队列
+### 04. 队列
 
 - 队列基础知识
   - [队列基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/04.Queue/01.Queue-Basic/01.Queue-Basic.md)
@@ -68,12 +66,12 @@
   - [优先队列知识](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)
 
-## 05. 哈希表
+### 05. 哈希表
 
 - [哈希表知识](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)
 
-## 06. 字符串
+### 06. 字符串
 
 - 字符串基础知识
   - [字符串基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/06.String/01.String-Basic/01.String-Basic.md)
@@ -93,9 +91,8 @@
   - [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)
-
 
-## 07. 树
+### 07. 树
 
 - 二叉树
   - [树与二叉树基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md)
@@ -116,7 +113,7 @@
   - [并查集知识](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)
 
-## 08. 图论
+### 08. 图论
 
 - 图的基础知识
   - [图的定义和分类](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/08.Graph/01.Graph-Basic/01.Graph-Basic.md)
@@ -149,7 +146,7 @@
   - [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)
 
-## 09. 基础算法
+### 09. 基础算法
 
 - 枚举算法
   - [枚举算法知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md)
@@ -170,7 +167,7 @@
   - [位运算知识](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)
 
-## 10. 动态规划
+### 10. 动态规划
 
 - 动态规划基础
   - [动态规划基础知识](https://github.com/itcharge/LeetCode-Py/blob/main/Contents/10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md)
@@ -213,4 +210,6 @@
   - [四边形不等式优化](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)
 
-## 11. 附加内容
+### 11. 附加内容
+
+- [内容完成时间线](./Contents/Others/Update-Time.md)
diff --git a/Assets/Origins/README-Head.md b/Assets/Origins/README-Head.md
@@ -1,14 +1,14 @@
 # 算法通关手册（LeetCode）
 
-## 项目简介
+## 01. 项目简介
 
 - **「算法与数据结构」** 基础知识的讲解教程，「LeetCode」800+ 道题目的详细解析。本项目易于理解，没有大跨度的思维跳跃，项目中使用部分图示、例子来帮助理解。
 
 - 本教程先从基础的数据结构和算法开始讲解，再针对不同分类的数据结构和算法，进行具体题目的讲解分析。让读者可以通过「算法基础理论学习」和「编程实战学习」相结合的方式，彻底的掌握算法知识。
 
 - 本教程采用 Python 作为编程语言，要求学习者已有基本 Python 程序设计的知识与经验。
 
-## 项目地址
+## 02. 项目地址
 
 欢迎右上角 **「Star ⭐️  」** 和 **「Fork」**，这是对我最大的鼓励和支持。
 
@@ -18,11 +18,11 @@
 
 - 电子书地址：[https://algo.itcharge.cn](https://algo.itcharge.cn)
 
-![](./Assets/Images/algo-book-light.png)
+![电子书浅色模式](./Assets/Images/algo-book-light.png)
 
-![](./Assets/Images/algo-book-dark.png)
+![电子书深色模式](./Assets/Images/algo-book-dark.png)
 
-## 关于作者
+## 03. 关于作者
 
 我是一名 iOS / macOS 的开发程序员，另外也是北航软院的一名非全硕士（在读）。曾在大学期间学习过算法知识，并参加过 3 年的 ACM 比赛， 但水平有限，未能取得理想成绩。但是这 3 年的 ACM 经历，给我最大的收获是锻炼了自己的逻辑思维和解决实际问题的能力，这种能力为我今后的工作、学习打下了坚实的基础。
 
@@ -35,7 +35,12 @@
 
 ![](./Assets/Images/itcharge-qr-code.png)
 
-## 版权说明
+## 04. 版权说明
 
 - 本教程采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。
-- 本教程题解中的所有题目版权均归  [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。
+- 本教程题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。
+
+## 05. 章节目录
+
+![章节目录](./Assets/Images/algo-book-contents.png)
+
diff --git a/Assets/Scripts/create_solutions_list.py b/Assets/Scripts/create_solutions_list.py
@@ -107,7 +107,7 @@ def merge_readme_file(solotions_output_path, readme_head_path, readme_catalogue_
     catalogue_list_lines = catalogue_list_file.readlines()
     if len(catalogue_list_lines) > 0:
         catalogue_list_title = catalogue_list_lines[0].strip('\n')
-        catalogue_list_title = '## [' + catalogue_list_title + '](./Contents/00.Introduction/04.Solutions-List.md)'
+        catalogue_list_title = '### [' + catalogue_list_title + '](./Contents/00.Introduction/04.Solutions-List.md)'
         catalogue_list_title = catalogue_list_title.replace('# LeetCode 题解', '12. LeetCode 题解')
         readme_file.writelines(catalogue_list_title)
     catalogue_list_file.close()
@@ -118,13 +118,15 @@ def merge_readme_file(solotions_output_path, readme_head_path, readme_catalogue_
     # 生成 Contents/index.md 文件
     content_index_file = open(content_index_path, 'w')
     content_index_file.writelines("# 算法通关手册（LeetCode）\n\n")
+    content_index_file.writelines("## 章节目录\n\n")
 
     # 将章节目录写入 Contents/index.md 文件中
     readme_catelogue_list_file = open(readme_catalogue_list_path)
     catalogue_list_lines = readme_catelogue_list_file.readlines()
     for catalogue_list_line in catalogue_list_lines:
         catalogue_list_line = catalogue_list_line.replace('https://github.com/itcharge/LeetCode-Py/blob/main/Contents', '.')
         content_index_file.write(catalogue_list_line)
+
     readme_catelogue_list_file.close()
     content_index_file.close()
 

diff --git a/Contents/00.Introduction/index.md b/Contents/00.Introduction/index.md
@@ -3,7 +3,7 @@
 - [算法与数据结构](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 题解（字典序排序，850+ 道题解）](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)
diff --git a/Contents/index.md b/Contents/index.md
@@ -1,18 +1,18 @@
 # 算法通关手册（LeetCode）
 
-# 内容章节
+## 章节目录
 
-## 00. 绪论
+### 00. 绪论
 
 - [算法与数据结构](./00.Introduction/01.Data-Structures-Algorithms.md)
 - [算法复杂度](./00.Introduction/02.Algorithm-Complexity.md)
 - [LeetCode 入门与攻略](./00.Introduction/03.LeetCode-Guide.md)
-- [LeetCode 题解（字典序排序，700+ 道题解）](./00.Introduction/04.Solutions-List.md)
+- [LeetCode 题解（字典序排序，850+ 道题解）](./00.Introduction/04.Solutions-List.md)
 - [LeetCode 题解（按分类排序，推荐刷题列表 ★★★）](./00.Introduction/05.Categories-List.md)
 - [LeetCode 面试最常考 100 题（按分类排序）](./00.Introduction/06.Interview-100-List.md)
 - [LeetCode 面试最常考 200 题（按分类排序）](./00.Introduction/07.Interview-200-List.md)
 
-## 01. 数组
+### 01. 数组
 
 - 数组基础知识
   - [数组基础知识](./01.Array/01.Array-Basic/01.Array-Basic.md)
@@ -40,7 +40,7 @@
   - [数组滑动窗口知识](./01.Array/05.Array-Sliding-Window/01.Array-Sliding-Window.md)
   - [数组滑动窗口题目](./01.Array/05.Array-Sliding-Window/02.Array-Sliding-Window-List.md)
 
-## 02. 链表
+### 02. 链表
 
 - 链表基础知识
   - [链表基础知识](./02.Linked-List/01.Linked-List-Basic/01.Linked-List-Basic.md)
@@ -52,7 +52,7 @@
   - [链表双指针知识](./02.Linked-List/03.Linked-List-Two-Pointers/01.Linked-List-Two-Pointers.md)
   - [链表双指针题目](./02.Linked-List/03.Linked-List-Two-Pointers/02.Linked-List-Two-Pointers-List.md)
 
-## 03. 堆栈
+### 03. 堆栈
 
 - 堆栈基础知识
   - [堆栈基础知识](./03.Stack/01.Stack-Basic/01.Stack-Basic.md)
@@ -61,7 +61,7 @@
   - [单调栈知识](./03.Stack/02.Monotone-Stack/01.Monotone-Stack.md)
   - [单调栈题目](./03.Stack/02.Monotone-Stack/02.Monotone-Stack-List.md)
 
-## 04. 队列
+### 04. 队列
 
 - 队列基础知识
   - [队列基础知识](./04.Queue/01.Queue-Basic/01.Queue-Basic.md)
@@ -70,12 +70,12 @@
   - [优先队列知识](./04.Queue/02.Priority-Queue/01.Priority-Queue.md)
   - [优先队列题目](./04.Queue/02.Priority-Queue/02.Priority-Queue-List.md)
 
-## 05. 哈希表
+### 05. 哈希表
 
 - [哈希表知识](./05.Hash-Table/01.Hash-Table.md)
 - [哈希表题目](./05.Hash-Table/02.Hash-Table-List.md)
 
-## 06. 字符串
+### 06. 字符串
 
 - 字符串基础知识
   - [字符串基础知识](./06.String/01.String-Basic/01.String-Basic.md)
@@ -95,9 +95,8 @@
   - [AC 自动机题目](./06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md)
   - [后缀数组知识](./06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md)
   - [后缀数组题目](./06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md)
-
 
-## 07. 树
+### 07. 树
 
 - 二叉树
   - [树与二叉树基础知识](./07.Tree/01.Binary-Tree/01.Binary-Tree-Basic.md)
@@ -118,7 +117,7 @@
   - [并查集知识](./07.Tree/05.Union-Find/01.Union-Find.md)
   - [并查集题目](./07.Tree/05.Union-Find/02.Union-Find-List.md)
 
-## 08. 图论
+### 08. 图论
 
 - 图的基础知识
   - [图的定义和分类](./08.Graph/01.Graph-Basic/01.Graph-Basic.md)
@@ -151,7 +150,7 @@
   - [Hopcroft-Karp 算法](./08.Graph/05.Graph-Bipartite/05.Graph-Hopcroft-Karp.md)
   - [二分图最大匹配题目](./08.Graph/05.Graph-Bipartite/06.Graph-Bipartite-Matching-List.md)
 
-## 09. 基础算法
+### 09. 基础算法
 
 - 枚举算法
   - [枚举算法知识](./09.Algorithm-Base/01.Enumeration-Algorithm/01.Enumeration-Algorithm.md)
@@ -172,7 +171,7 @@
   - [位运算知识](./09.Algorithm-Base/06.Bit-Operation/01.Bit-Operation.md)
   - [位运算题目](./09.Algorithm-Base/06.Bit-Operation/02.Bit-Operation-List.md)
 
-## 10. 动态规划
+### 10. 动态规划
 
 - 动态规划基础
   - [动态规划基础知识](./10.Dynamic-Programming/01.Dynamic-Programming-Basic/01.Dynamic-Programming-Basic.md)
@@ -215,4 +214,6 @@
   - [四边形不等式优化](./10.Dynamic-Programming/11.DP-Optimization/03.Quadrangle-Optimization.md)
   - [动态规划优化题目](./10.Dynamic-Programming/11.DP-Optimization/04.DP-Optimization-List.md)
 
-## 11. 附加内容
+### 11. 附加内容
+
+- [内容完成时间线](./Contents/Others/Update-Time.md)
diff --git a/README.md b/README.md
@@ -38,7 +38,8 @@
 ## 04. 版权说明
 
 - 本教程采用 [知识署名—非商业性使用—禁止演绎（BY-NC-ND）4.0 协议国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。
-- 本教程题解中的所有题目版权均归  [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。
+- 本教程题解中的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode.cn/) 所有。
+
 ## 05. 章节目录
 
 ![章节目录](./Assets/Images/algo-book-contents.png)
@@ -136,7 +137,6 @@
   - [AC 自动机题目](./Contents/06.String/03.String-Multi-Pattern-Matching/04.AC-Automaton-List.md)
   - [后缀数组知识](./Contents/06.String/03.String-Multi-Pattern-Matching/05.Suffix-Array.md)
   - [后缀数组题目](./Contents/06.String/03.String-Multi-Pattern-Matching/06.Suffix-Array-List.md)
-
 
 ### 07. 树
 
@@ -259,5 +259,4 @@
 ### 11. 附加内容
 
 - [内容完成时间线](./Contents/Others/Update-Time.md)
-
 ### [12. LeetCode 题解（已完成 859 道）](./Contents/00.Introduction/04.Solutions-List.md)