From cb08e7a87e8a5b75280ecb58d1edf4addc29d3c0 Mon Sep 17 00:00:00 2001 From: ITCharge Date: Tue, 23 Sep 2025 14:57:36 +0800 Subject: [PATCH 1/3] =?UTF-8?q?=E4=BC=98=E5=8C=96=E9=93=BE=E6=8E=A5?= =?UTF-8?q?=E6=A0=BC=E5=BC=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 4 +- docs/00_preface/00_04_leetcode_guide.md | 12 +++--- .../02_linked_list/02_01_linked_list_basic.md | 2 +- .../03_01_stack_basic.md | 2 +- .../03_02_monotone_stack.md | 2 +- docs/06_graph/06_03_graph_dfs.md | 2 +- docs/06_graph/06_04_graph_bfs.md | 2 +- .../08_05_knapsack_problem_01.md | 2 +- .../08_06_knapsack_problem_02.md | 2 +- .../08_07_knapsack_problem_03.md | 2 +- .../08_08_knapsack_problem_04.md | 4 +- docs/08_dynamic_programming/index.md | 38 +++++++++++-------- docs/README.md | 4 +- 13 files changed, 43 insertions(+), 35 deletions(-) diff --git a/README.md b/README.md index 752473e7..850de7ab 100644 --- a/README.md +++ b/README.md @@ -9,9 +9,9 @@ ### 1.1 源码地址 -本书内容及代码都放在 [Github repo](https://github.com/itcharge/AlgoNote) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 +本书内容及代码都放在 [Github repo](https://github.com/ITCharge/AlgoNote) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 -- Github 地址：[https://github.com/itcharge/AlgoNote](https://github.com/itcharge/AlgoNote) +- Github 地址：[https://github.com/ITCharge/AlgoNote](https://github.com/ITCharge/AlgoNote) ### 1.2 目标读者 diff --git a/docs/00_preface/00_04_leetcode_guide.md b/docs/00_preface/00_04_leetcode_guide.md index b1fd1671..11e87156 100644 --- a/docs/00_preface/00_04_leetcode_guide.md +++ b/docs/00_preface/00_04_leetcode_guide.md @@ -156,7 +156,7 @@ class Solution: 当然，也可以直接看我写的「算法通关手册」，欢迎指正和提出建议，万分感谢。 -- 「算法通关手册」GitHub 地址：[https://github.com/itcharge/AlgoNote](https://github.com/itcharge/AlgoNote) +- 「算法通关手册」GitHub 地址：[https://github.com/ITCharge/AlgoNote](https://github.com/ITCharge/AlgoNote) - 「算法通关手册」电子书网站地址：[https://algo.itcharge.cn](https://algo.itcharge.cn) ### 3.2 LeetCode 刷题顺序 @@ -175,14 +175,14 @@ LeetCode 的题目序号并不是按难易程度排序的，不建议按序号 或者直接按照我整理的分类刷题列表进行刷题： -- LeetCode 分类刷题列表：[点击打开「LeetCode 分类刷题列表」](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md) +- LeetCode 分类刷题列表：[点击打开「LeetCode 分类刷题列表」](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md) 正在准备面试、没有太多时间刷题的小伙伴，可以按照我总结的「LeetCode 面试最常考 100 题」、「LeetCode 面试最常考 200 题」进行刷题。 > **说明**：「LeetCode 面试最常考 100 题」、「LeetCode 面试最常考 200 题」是笔者根据「[CodeTop 企业题库](https://codetop.cc/home)」按频度从高到低进行筛选，并且去除了一部分 LeetCode 上没有的题目和重复题目后得到的题目清单。 -- [LeetCode 面试最常考 100 题](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_07_interview_100_list.md) -- [LeetCode 面试最常考 200 题](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_08_interview_200_list.md) +- [LeetCode 面试最常考 100 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_07_interview_100_list.md) +- [LeetCode 面试最常考 200 题](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_08_interview_200_list.md) ### 3.3 LeetCode 刷题技巧 @@ -247,8 +247,8 @@ LeetCode 是一个在线编程练习平台，主要用于提升算法和编程 ## 练习题目 -- [2235. 两整数相加](https://github.com/itcharge/AlgoNote/tree/main/docs/solutions/2200-2299/add-two-integers.md) -- [1929. 数组串联](https://github.com/itcharge/AlgoNote/tree/main/docs/solutions/1900-1999/concatenation-of-array.md) +- [2235. 两整数相加](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/2200-2299/add-two-integers.md) +- [1929. 数组串联](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1900-1999/concatenation-of-array.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 8701aac8..b82e412c 100644 --- a/docs/02_linked_list/02_01_linked_list_basic.md +++ b/docs/02_linked_list/02_01_linked_list_basic.md @@ -323,7 +323,7 @@ def removeInside(self, index): - [0234. 回文链表](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0200-0299/palindrome-linked-list.md) - [0138. 随机链表的复制](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0100-0199/copy-list-with-random-pointer.md) -- [链表基础题目列表](https://github.com/itcharge/AlgoNote/tree/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) +- [链表基础题目列表](https://github.com/ITCharge/AlgoNote/tree/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_01_stack_basic.md b/docs/03_stack_queue_hash_table/03_01_stack_basic.md index 0604588e..1c9e823c 100644 --- a/docs/03_stack_queue_hash_table/03_01_stack_basic.md +++ b/docs/03_stack_queue_hash_table/03_01_stack_basic.md @@ -356,7 +356,7 @@ class Solution: - [0394. 字符串解码](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/decode-string.md) - [0946. 验证栈序列](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0900-0999/validate-stack-sequences.md) -- [栈基础题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%A0%88%E5%9F%BA%E7%A1%80%E9%A2%98%E7%9B%AE) +- [栈基础题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%A0%88%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 6aef0064..f2e88001 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 @@ -266,7 +266,7 @@ class Solution: - [0739. 每日温度](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0700-0799/daily-temperatures.md) - [0316. 去除重复字母](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/remove-duplicate-letters.md) -- [单调栈题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%8D%95%E8%B0%83%E6%A0%88%E9%A2%98%E7%9B%AE) +- [单调栈题目列表](https://github.com/ITCharge/AlgoNote/tree/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_03_graph_dfs.md b/docs/06_graph/06_03_graph_dfs.md index 1b9a0e74..6b0da134 100644 --- a/docs/06_graph/06_03_graph_dfs.md +++ b/docs/06_graph/06_03_graph_dfs.md @@ -359,7 +359,7 @@ class Solution: - [1020. 飞地的数量](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/number-of-enclaves.md) - [1254. 统计封闭岛屿的数目](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1200-1299/number-of-closed-islands.md) -- [深度优先搜索题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) +- [深度优先搜索题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/docs/06_graph/06_04_graph_bfs.md b/docs/06_graph/06_04_graph_bfs.md index 6d875267..c9153deb 100644 --- a/docs/06_graph/06_04_graph_bfs.md +++ b/docs/06_graph/06_04_graph_bfs.md @@ -278,7 +278,7 @@ class Solution: - [0322. 零钱兑换](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0300-0399/coin-change.md) - [LCR 130. 衣橱整理](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/LCR/ji-qi-ren-de-yun-dong-fan-wei-lcof.md) -- [广度优先搜索题目列表](https://github.com/itcharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) +- [广度优先搜索题目列表](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_06_categories_list.md#%E5%B9%BF%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2%E9%A2%98%E7%9B%AE) ## 参考资料 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 bc825b04..c20c91a6 100644 --- a/docs/08_dynamic_programming/08_05_knapsack_problem_01.md +++ b/docs/08_dynamic_programming/08_05_knapsack_problem_01.md @@ -268,7 +268,7 @@ class Solution: - [0494. 目标和](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/target-sum.md) - [1049. 最后一块石头的重量 II](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1000-1099/last-stone-weight-ii.md) -- [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%E9%A2%98%E7%9B%AE) +- [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%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 c6e11f91..df9abd34 100644 --- a/docs/08_dynamic_programming/08_06_knapsack_problem_02.md +++ b/docs/08_dynamic_programming/08_06_knapsack_problem_02.md @@ -243,7 +243,7 @@ class Solution: - [0518. 零钱兑换 II]() - [0377. 组合总和 IV]() -- [完全背包问题题目列表](https://github.com/itcharge/AlgoNote/tree/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) +- [完全背包问题题目列表](https://github.com/ITCharge/AlgoNote/tree/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 51a3231f..87ddb6c4 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#%E5%A4%9A%E9%87%8D%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98%E9%A2%98%E7%9B%AE) +- [多重背包问题题目列表](https://github.com/ITCharge/AlgoNote/tree/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 fab0a640..2a4e46b7 100644 --- a/docs/08_dynamic_programming/08_08_knapsack_problem_04.md +++ b/docs/08_dynamic_programming/08_08_knapsack_problem_04.md @@ -327,8 +327,8 @@ class Solution: - [1155. 掷骰子等于目标和的方法数](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/1100-1199/number-of-dice-rolls-with-target-sum.md) - [0474. 一和零](https://github.com/ITCharge/AlgoNote/tree/main/docs/solutions/0400-0499/ones-and-zeroes.md) -- [分组背包问题题目列表](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%E9%A2%98%E7%9B%AE) -- [多维背包问题题目列表](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%E9%A2%98%E7%9B%AE) +- [分组背包问题题目列表](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%E9%A2%98%E7%9B%AE) +- [多维背包问题题目列表](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%E9%A2%98%E7%9B%AE) ## 参考资料 diff --git a/docs/08_dynamic_programming/index.md b/docs/08_dynamic_programming/index.md index 110aee16..344997e8 100644 --- a/docs/08_dynamic_programming/index.md +++ b/docs/08_dynamic_programming/index.md @@ -1,17 +1,25 @@ +![](https://qcdn.itcharge.cn/images/20250923144601.png) + +::: tip 引 言 +动态规划如同在迷雾中铺设星光小径。 + +循着昨日星辰的余晖，步步生辉，终将抵达最璀璨的彼岸。 +::: + ## 本章内容 -- [8.1 动态规划基础](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_01_dynamic_programming_basic.md) -- [8.2 记忆化搜索](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_02_memoization_search.md) -- [8.3 线性 DP（一）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_03_linear_dp_01.md) -- [8.4 线性 DP（二）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_04_linear_dp_02.md) -- [8.5 背包问题知识（一）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_05_knapsack_problem_01.md) -- [8.6 背包问题知识（二）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_06_knapsack_problem_02.md) -- [8.7 背包问题知识（三）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_07_knapsack_problem_03.md) -- [8.8 背包问题知识（四）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_08_knapsack_problem_04.md) -- [8.9 背包问题知识（五）](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_09_knapsack_problem_05.md) -- [8.10 区间 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_10_interval_dp.md) -- [8.11 树形 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_11_tree_dp.md) -- [8.12 状态压缩 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_12_state_compression_dp.md) -- [8.13 计数 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_13_counting_dp.md) -- [8.14 数位 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_14_digit_dp.md) -- [8.15 概率 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_15_probability_dp.md) +- [8.1 动态规划基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_01_dynamic_programming_basic.md) +- [8.2 记忆化搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_02_memoization_search.md) +- [8.3 线性 DP（一）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_03_linear_dp_01.md) +- [8.4 线性 DP（二）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_04_linear_dp_02.md) +- [8.5 背包问题知识（一）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_05_knapsack_problem_01.md) +- [8.6 背包问题知识（二）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_06_knapsack_problem_02.md) +- [8.7 背包问题知识（三）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_07_knapsack_problem_03.md) +- [8.8 背包问题知识（四）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_08_knapsack_problem_04.md) +- [8.9 背包问题知识（五）](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_09_knapsack_problem_05.md) +- [8.10 区间 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_10_interval_dp.md) +- [8.11 树形 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_11_tree_dp.md) +- [8.12 状态压缩 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_12_state_compression_dp.md) +- [8.13 计数 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_13_counting_dp.md) +- [8.14 数位 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_14_digit_dp.md) +- [8.15 概率 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_15_probability_dp.md) diff --git a/docs/README.md b/docs/README.md index 752473e7..850de7ab 100644 --- a/docs/README.md +++ b/docs/README.md @@ -9,9 +9,9 @@ ### 1.1 源码地址 -本书内容及代码都放在 [Github repo](https://github.com/itcharge/AlgoNote) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 +本书内容及代码都放在 [Github repo](https://github.com/ITCharge/AlgoNote) 中，欢迎在下方项目中 **「Star ⭐️ 」** 和 **「Fork」**，这是对我最大的鼓励和支持。 -- Github 地址：[https://github.com/itcharge/AlgoNote](https://github.com/itcharge/AlgoNote) +- Github 地址：[https://github.com/ITCharge/AlgoNote](https://github.com/ITCharge/AlgoNote) ### 1.2 目标读者 From 159671432d66711a7aeca23f0a82e3437b026322 Mon Sep 17 00:00:00 2001 From: ITCharge Date: Tue, 23 Sep 2025 14:58:12 +0800 Subject: [PATCH 2/3] =?UTF-8?q?=E7=AB=A0=E8=8A=82=E7=9B=AE=E5=BD=95?= =?UTF-8?q?=E9=A1=B5=E5=A2=9E=E5=8A=A0=E5=BC=95=E8=A8=80=E5=92=8C=E5=9B=BE?= =?UTF-8?q?=E7=89=87?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- docs/00_preface/index.md | 8 ++++++++ docs/01_array/index.md | 8 ++++++++ docs/02_linked_list/index.md | 8 ++++++++ docs/03_stack_queue_hash_table/index.md | 10 ++++++++++ docs/04_string/index.md | 8 ++++++++ docs/05_tree/index.md | 8 ++++++++ docs/06_graph/index.md | 8 ++++++++ docs/07_algorithm/index.md | 18 ++++++++++++++++++ 8 files changed, 76 insertions(+) diff --git a/docs/00_preface/index.md b/docs/00_preface/index.md index e640b2da..9fb51255 100644 --- a/docs/00_preface/index.md +++ b/docs/00_preface/index.md @@ -1,3 +1,11 @@ +![](https://qcdn.itcharge.cn/images/20250923140208.png) + +::: tip 引 言 +数据结构如同星辰，算法宛若清风，星光与微风交织，点亮智慧的夜空。 + +愿本书与你同行，助你轻装前行，照亮属于你的算法之路。 +::: + # 本章内容 - [0.1 前言](https://github.com/ITCharge/AlgoNote/tree/main/docs/00_preface/00_01_preface.md) diff --git a/docs/01_array/index.md b/docs/01_array/index.md index 0117cdf2..b7056ded 100644 --- a/docs/01_array/index.md +++ b/docs/01_array/index.md @@ -1,3 +1,11 @@ +![](https://qcdn.itcharge.cn/images/20250923140234.png) + +::: tip 引 言 +数组如同连续砖块砌成的墙。 + +每一块砖石紧密相依，井然有序，宛如时光的流转，悄然记录着数据的点滴。 +::: + ## 本章内容 - [1.1 数组基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/01_array/01_01_array_basic.md) diff --git a/docs/02_linked_list/index.md b/docs/02_linked_list/index.md index 9e76ebae..bc1762dd 100644 --- a/docs/02_linked_list/index.md +++ b/docs/02_linked_list/index.md @@ -1,3 +1,11 @@ +![](https://qcdn.itcharge.cn/images/20250923140251.png) + +::: tip 引 言 +链表如同夜空中串联的星星。 + +节点相连，如繁星串珠，静静铺展成一条灵动的数据长河。 +::: + ## 本章内容 - [2.1 链表基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/02_linked_list/02_01_linked_list_basic.md) diff --git a/docs/03_stack_queue_hash_table/index.md b/docs/03_stack_queue_hash_table/index.md index ee936ab3..e5671663 100644 --- a/docs/03_stack_queue_hash_table/index.md +++ b/docs/03_stack_queue_hash_table/index.md @@ -1,3 +1,13 @@ +![](https://qcdn.itcharge.cn/images/20250923140308.png) + +::: tip 引 言 +栈如杯中叠盘，盘盘相扣，取放皆自上，后进先出。 + +队列如河中行舟，前舟先行，后舟继发，川流不息。 + +哈希表如图书馆索引卡，万卷藏于指尖，瞬息之间，尽览群书。 +::: + ## 本章内容 - [3.1 栈基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/03_stack_queue_hash_table/03_01_stack_basic.md) diff --git a/docs/04_string/index.md b/docs/04_string/index.md index cadd9936..dbdef6bf 100644 --- a/docs/04_string/index.md +++ b/docs/04_string/index.md @@ -1,3 +1,11 @@ +![](https://qcdn.itcharge.cn/images/20250923140327.png) + +::: tip 引 言 +字符串如同夜色中流淌的音符。 + +如清风拂过琴弦，谱写数据的旋律与梦想。 +::: + ## 本章内容 - [4.1 字符串基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/04_string/04_01_string_basic.md) diff --git a/docs/05_tree/index.md b/docs/05_tree/index.md index 80ec4609..0738a2d0 100644 --- a/docs/05_tree/index.md +++ b/docs/05_tree/index.md @@ -1,3 +1,11 @@ +![](https://qcdn.itcharge.cn/images/20250923140359.png) + +::: tip 引 言 +树如同大地上拔节生长的脉络。 + +枝叶纵横，层层递进，信息在脉络间流转，万物由此相连。 +::: + ## 本章内容 - [5.1 树与二叉树基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/05_tree/05_01_tree_basic.md) diff --git a/docs/06_graph/index.md b/docs/06_graph/index.md index 8685e0e3..c37c2aa2 100644 --- a/docs/06_graph/index.md +++ b/docs/06_graph/index.md @@ -1,3 +1,11 @@ +![](https://qcdn.itcharge.cn/images/20250923140508.png) + +::: tip 引 言 +图如同无垠夜空中繁星交织成的瑰丽星网。 + +点点星光闪烁，彼此相连，交织成一张神秘而浪漫的梦幻之网，铺展出无尽的路径与无限的可能。 +::: + ## 本章内容 - [6.1 图的定义和分类](https://github.com/ITCharge/AlgoNote/tree/main/docs/06_graph/06_01_graph_basic.md) diff --git a/docs/07_algorithm/index.md b/docs/07_algorithm/index.md index 1e2d7463..a399f5b4 100644 --- a/docs/07_algorithm/index.md +++ b/docs/07_algorithm/index.md @@ -1,3 +1,21 @@ +![](https://qcdn.itcharge.cn/images/20250923140522.png) + +::: tip 引 言 +算法如梦中星河，闪烁着智慧的光芒： + +枚举如夜空点点，耐心数尽每一颗星辰； + +递归如山谷回音，层层叠叠，绵延不绝； + +分治如破晓晨曦，将混沌一分为二，终归明朗； + +回溯如时光逆旅，步步回首，终觅最美风景； + +贪心如追光旅人，逐一缕微光，直奔理想彼岸； + +位运算如星尘魔法，指尖轻触，万象变幻。 +::: + ## 本章内容 - [7.1 枚举算法](https://github.com/ITCharge/AlgoNote/tree/main/docs/07_algorithm/07_01_enumeration_algorithm.md) From 478f0ec320a517ac40d61f347e8a7793afbc676b Mon Sep 17 00:00:00 2001 From: ITCharge Date: Tue, 23 Sep 2025 15:25:05 +0800 Subject: [PATCH 3/3] =?UTF-8?q?=E4=BF=AE=E6=AD=A3=E5=9B=BE=E7=89=87?= =?UTF-8?q?=E6=8F=8F=E8=BF=B0?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- docs/00_preface/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/00_preface/index.md b/docs/00_preface/index.md index 9fb51255..2854e0c5 100644 --- a/docs/00_preface/index.md +++ b/docs/00_preface/index.md @@ -1,4 +1,4 @@ -![](https://qcdn.itcharge.cn/images/20250923140208.png) +![](https://qcdn.itcharge.cn/images/20250923152426.png) ::: tip 引 言 数据结构如同星辰，算法宛若清风，星光与微风交织，点亮智慧的夜空。