diff --git a/docs/00_preface/00_06_categories_list.md b/docs/00_preface/00_06_categories_list.md
index 63d7c625..bc069d61 100644
--- a/docs/00_preface/00_06_categories_list.md
+++ b/docs/00_preface/00_06_categories_list.md
@@ -287,7 +287,7 @@
 
 ## 第 2 章 链表
 
-### 链表经典题目
+### 链表基础题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -351,7 +351,7 @@
 | [0071. 简化路径](https://leetcode.cn/problems/simplify-path/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/simplify-path.md) | 栈、字符串 | 中等 |
 
 
-### 单调栈
+### 单调栈题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -566,7 +566,7 @@
 | [0732. 我的日程安排表 III](https://leetcode.cn/problems/my-calendar-iii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/my-calendar-iii.md) | 设计、线段树、二分查找、有序集合、前缀和 | 困难 |
 
 
-#### 扫描线问题
+#### 扫描线问题题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -720,7 +720,7 @@
 | [2045. 到达目的地的第二短时间](https://leetcode.cn/problems/second-minimum-time-to-reach-destination/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2000-2099/second-minimum-time-to-reach-destination.md) | 广度优先搜索、图、最短路 | 困难 |
 
 
-### 差分约束系统
+### 差分约束系统题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -995,7 +995,7 @@
 
 ### 背包问题题目
 
-#### 0-1 背包问题
+#### 0-1 背包问题题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -1004,7 +1004,7 @@
 | [1049. 最后一块石头的重量 II](https://leetcode.cn/problems/last-stone-weight-ii/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/last-stone-weight-ii.md) | 数组、动态规划 | 中等 |
 
 
-#### 完全背包问题
+#### 完全背包问题题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -1017,9 +1017,9 @@
 | [1449. 数位成本和为目标值的最大数字](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1400-1499/form-largest-integer-with-digits-that-add-up-to-target.md) | 数组、动态规划 | 困难 |
 
 
-#### 多重背包问题
+#### 多重背包问题题目
 
-#### 分组背包问题
+#### 分组背包问题题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -1027,7 +1027,7 @@
 | [2585. 获得分数的方法数](https://leetcode.cn/problems/number-of-ways-to-earn-points/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2500-2599/number-of-ways-to-earn-points.md) | 数组、动态规划 | 困难 |
 
 
-#### 多维背包问题
+#### 多维背包问题题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
diff --git a/docs/00_preface/00_07_interview_100_list.md b/docs/00_preface/00_07_interview_100_list.md
index 7476a928..e58d7ed8 100644
--- a/docs/00_preface/00_07_interview_100_list.md
+++ b/docs/00_preface/00_07_interview_100_list.md
@@ -139,7 +139,7 @@
 
 ## 第 2 章 链表
 
-### 链表经典题目
+### 链表基础题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -187,7 +187,7 @@
 | [0032. 最长有效括号](https://leetcode.cn/problems/longest-valid-parentheses/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/longest-valid-parentheses.md) | 栈、字符串、动态规划 | 困难 |
 
 
-### 单调栈
+### 单调栈题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
diff --git a/docs/00_preface/00_08_interview_200_list.md b/docs/00_preface/00_08_interview_200_list.md
index e389bb52..df7f81e1 100644
--- a/docs/00_preface/00_08_interview_200_list.md
+++ b/docs/00_preface/00_08_interview_200_list.md
@@ -191,7 +191,7 @@
 
 ## 02. 链表
 
-### 链表经典题目
+### 链表基础题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
@@ -248,7 +248,7 @@
 | [0071. 简化路径](https://leetcode.cn/problems/simplify-path/) | [题解](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0001-0099/simplify-path.md) | 栈、字符串 | 中等 |
 
 
-### 单调栈
+### 单调栈题目
 
 | 标题 | 题解 | 标签 | 难度 |
 | :--- | :--- | :--- | :--- |
diff --git a/docs/02_linked_list/02_01_linked_list_basic.md b/docs/02_linked_list/02_01_linked_list_basic.md
index 8fe03bfa..ea045f88 100644
--- a/docs/02_linked_list/02_01_linked_list_basic.md
+++ b/docs/02_linked_list/02_01_linked_list_basic.md
@@ -361,7 +361,7 @@ def removeInside(self, index):
 
 ## 练习题目
 
-- [链表经典题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E7%BB%8F%E5%85%B8%E9%A2%98%E7%9B%AE)
+- [链表基础题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E9%93%BE%E8%A1%A8%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE)
 
 ## 参考资料
 
diff --git a/docs/03_stack_queue_hash_table/03_02_monotone_stack.md b/docs/03_stack_queue_hash_table/03_02_monotone_stack.md
index 8d6db4b7..8b045dc9 100644
--- a/docs/03_stack_queue_hash_table/03_02_monotone_stack.md
+++ b/docs/03_stack_queue_hash_table/03_02_monotone_stack.md
@@ -270,7 +270,7 @@ class Solution:
 
 ## 练习题目
 
-- [单调栈题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E8%B0%83%E6%A0%88)
+- [单调栈题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E8%B0%83%E6%A0%88%E9%A2%98%E7%9B%AE)
 
 ## 参考资料
 
diff --git a/docs/06_graph/06_11_graph_system_of_difference_constraints.md b/docs/06_graph/06_11_graph_system_of_difference_constraints.md
index e95a5370..13e64d6d 100644
--- a/docs/06_graph/06_11_graph_system_of_difference_constraints.md
+++ b/docs/06_graph/06_11_graph_system_of_difference_constraints.md
@@ -121,4 +121,4 @@ def solve_difference_constraints(n, constraints):
 
 ## 练习题目
 
-- [差分约束系统题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%B7%AE%E5%88%86%E7%BA%A6%E6%9D%9F%E7%B3%BB%E7%BB%9F)
\ No newline at end of file
+- [差分约束系统题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%B7%AE%E5%88%86%E7%BA%A6%E6%9D%9F%E7%B3%BB%E7%BB%9F%E9%A2%98%E7%9B%AE)
\ No newline at end of file
diff --git a/docs/06_graph/index.md b/docs/06_graph/index.md
index 1957ead9..4dc6ed5f 100644
--- a/docs/06_graph/index.md
+++ b/docs/06_graph/index.md
@@ -2,14 +2,14 @@
 
 - [6.1 图的定义和分类](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_01_graph_basic.md)
 - [6.2 图的存储结构和问题应用](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_02_graph_structure.md)
-- [图的深度优先搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_03_graph_dfs.md)
-- [图的广度优先搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_04_graph_bfs.md)
-- [图的拓扑排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_05_graph_topological_sorting.md)
-- [图的最小生成树](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_06_graph_minimum_spanning_tree.md)
-- [单源最短路径(一)](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_07_graph_shortest_path_01.md) 
-- [单源最短路径(二)](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_08_graph_shortest_path_02.md) 
-- [多源最短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_09_graph_multi_source_shortest_path.md)
-- [次短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_10_graph_the_second_shortest_path.md)
-- [差分约束系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_11_graph_system_of_difference_constraints.md)
-- [二分图基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_12_graph_bipartite_basic.md)
-- [二分图最大匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_13_graph_bipartite_matching.md)
+- [6.3 图的深度优先搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_03_graph_dfs.md)
+- [6.4 图的广度优先搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_04_graph_bfs.md)
+- [6.5 图的拓扑排序](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_05_graph_topological_sorting.md)
+- [6.6 图的最小生成树](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_06_graph_minimum_spanning_tree.md)
+- [6.7 单源最短路径(一)](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_07_graph_shortest_path_01.md) 
+- [6.8 单源最短路径(二)](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_08_graph_shortest_path_02.md) 
+- [6.9 多源最短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_09_graph_multi_source_shortest_path.md)
+- [6.10 次短路径](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_10_graph_the_second_shortest_path.md)
+- [6.11 差分约束系统](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_11_graph_system_of_difference_constraints.md)
+- [6.12 二分图基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_12_graph_bipartite_basic.md)
+- [6.13 二分图最大匹配](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_13_graph_bipartite_matching.md)
diff --git a/docs/08_dynamic_programming/08_05_knapsack_problem_01.md b/docs/08_dynamic_programming/08_05_knapsack_problem_01.md
index ea0d76c0..37b3fc87 100644
--- a/docs/08_dynamic_programming/08_05_knapsack_problem_01.md
+++ b/docs/08_dynamic_programming/08_05_knapsack_problem_01.md
@@ -264,7 +264,7 @@ class Solution:
 
 ## 练习题目
 
-- [0-1 背包问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#0-1-%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98)
+- [0-1 背包问题题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#0-1-%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE)
 
 
 ## 参考资料
diff --git a/docs/08_dynamic_programming/08_06_knapsack_problem_02.md b/docs/08_dynamic_programming/08_06_knapsack_problem_02.md
index 4ec3534a..cff37a91 100644
--- a/docs/08_dynamic_programming/08_06_knapsack_problem_02.md
+++ b/docs/08_dynamic_programming/08_06_knapsack_problem_02.md
@@ -238,7 +238,7 @@ class Solution:
 
 ## 练习题目
 
-- [完全背包问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#0-1-%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98)
+- [完全背包问题题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE)
 
 ## 参考资料
 
diff --git a/docs/08_dynamic_programming/08_07_knapsack_problem_03.md b/docs/08_dynamic_programming/08_07_knapsack_problem_03.md
index 10edb99b..975c5e90 100644
--- a/docs/08_dynamic_programming/08_07_knapsack_problem_03.md
+++ b/docs/08_dynamic_programming/08_07_knapsack_problem_03.md
@@ -206,7 +206,7 @@ class Solution:
 
 ## 练习题目
 
-- [多重背包题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#0-1-%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98)
+- [多重背包问题题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE)
 
 ## 参考资料
 
diff --git a/docs/08_dynamic_programming/08_08_knapsack_problem_04.md b/docs/08_dynamic_programming/08_08_knapsack_problem_04.md
index 59fde6a5..24a09d02 100644
--- a/docs/08_dynamic_programming/08_08_knapsack_problem_04.md
+++ b/docs/08_dynamic_programming/08_08_knapsack_problem_04.md
@@ -324,8 +324,8 @@ class Solution:
 
 ## 练习题目
 
-- [分组背包问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%88%86%E7%BB%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98)
-- [多维背包问题题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%A4%9A%E7%BB%B4%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98)
+- [分组背包问题题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%88%86%E7%BB%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE)
+- [多维背包问题题目列表](https://github.com/itcharge/AlgoNote/blob/main/docs/00_preface/00_06_categories_list.md#%E5%A4%9A%E7%BB%B4%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE)
 
 ## 参考资料
 
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/itcharge-LeetCode-Py/pull/201.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/itcharge-LeetCode-Py/pull/201.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>