mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-24 10:36:29 +08:00
1. Add section links to the chapter page.
2. Add chapter icons to navigation panel. 3. Replace recently added text with icon.
This commit is contained in:
parent
2caf3464ad
commit
06b309d021
2 changed files with 63 additions and 31 deletions
2
docs/chapter_appendix/index.md
Normal file
2
docs/chapter_appendix/index.md
Normal file
|
@ -0,0 +1,2 @@
|
|||
# 附录
|
||||
|
92
mkdocs.yml
92
mkdocs.yml
|
@ -73,6 +73,8 @@ extra:
|
|||
- icon: fontawesome/solid/code
|
||||
link: https://leetcode.cn/u/jyd/
|
||||
generator: false
|
||||
status:
|
||||
new: 最近添加
|
||||
|
||||
# Plugins
|
||||
plugins:
|
||||
|
@ -124,48 +126,56 @@ extra_css:
|
|||
|
||||
# Page tree
|
||||
nav:
|
||||
- 0. 前言:
|
||||
- 0. 前言:
|
||||
# [icon: material/book-open-outline]
|
||||
- chapter_preface/index.md
|
||||
- 0.1. 关于本书: chapter_preface/about_the_book.md
|
||||
- 0.2. 如何使用本书: chapter_preface/suggestions.md
|
||||
- 0.3. 小结: chapter_preface/summary.md
|
||||
- 1. 初识算法:
|
||||
- 1. 初识算法:
|
||||
# [icon: material/code-tags]
|
||||
- chapter_introduction/index.md
|
||||
- 1.1. 算法无处不在: chapter_introduction/algorithms_are_everywhere.md
|
||||
- 1.2. 算法是什么: chapter_introduction/what_is_dsa.md
|
||||
- 1.3. 小结: chapter_introduction/summary.md
|
||||
- 2. 复杂度:
|
||||
- 2. 复杂度:
|
||||
# [icon: material/timer-sand]
|
||||
- chapter_computational_complexity/index.md
|
||||
- 2.1. 算法效率评估: chapter_computational_complexity/performance_evaluation.md
|
||||
- 2.2. 时间复杂度: chapter_computational_complexity/time_complexity.md
|
||||
- 2.3. 空间复杂度: chapter_computational_complexity/space_complexity.md
|
||||
- 2.4. 小结: chapter_computational_complexity/summary.md
|
||||
- 3. 数据结构:
|
||||
- 3. 数据结构:
|
||||
# [icon: material/database-outline]
|
||||
- chapter_data_structure/index.md
|
||||
- 3.1. 数据结构分类: chapter_data_structure/classification_of_data_structure.md
|
||||
- 3.2. 基本数据类型: chapter_data_structure/basic_data_types.md
|
||||
- 3.3. 数字编码 *: chapter_data_structure/number_encoding.md
|
||||
- 3.4. 字符编码 *: chapter_data_structure/character_encoding.md
|
||||
- 3.5. 小结: chapter_data_structure/summary.md
|
||||
- 4. 数组与链表:
|
||||
- 4. 数组与链表:
|
||||
# [icon: material/view-grid-outline]
|
||||
- chapter_array_and_linkedlist/index.md
|
||||
- 4.1. 数组: chapter_array_and_linkedlist/array.md
|
||||
- 4.2. 链表: chapter_array_and_linkedlist/linked_list.md
|
||||
- 4.3. 列表: chapter_array_and_linkedlist/list.md
|
||||
- 4.4. 小结: chapter_array_and_linkedlist/summary.md
|
||||
- 5. 栈与队列:
|
||||
- 5. 栈与队列:
|
||||
# [icon: material/stack-overflow]
|
||||
- chapter_stack_and_queue/index.md
|
||||
- 5.1. 栈: chapter_stack_and_queue/stack.md
|
||||
- 5.2. 队列: chapter_stack_and_queue/queue.md
|
||||
- 5.3. 双向队列: chapter_stack_and_queue/deque.md
|
||||
- 5.4. 小结: chapter_stack_and_queue/summary.md
|
||||
- 6. 散列表:
|
||||
- 6. 散列表:
|
||||
# [icon: material/table-search]
|
||||
- chapter_hashing/index.md
|
||||
- 6.1. 哈希表(New): chapter_hashing/hash_map.md
|
||||
- 6.2. 哈希冲突(New): chapter_hashing/hash_collision.md
|
||||
- 6.3. 哈希算法(New): chapter_hashing/hash_algorithm.md
|
||||
- 6.1. 哈希表: chapter_hashing/hash_map.md
|
||||
- 6.2. 哈希冲突: chapter_hashing/hash_collision.md
|
||||
- 6.3. 哈希算法: chapter_hashing/hash_algorithm.md
|
||||
- 6.4. 小结: chapter_hashing/summary.md
|
||||
- 7. 树:
|
||||
- 7. 树:
|
||||
# [icon: material/graph-outline]
|
||||
- chapter_tree/index.md
|
||||
- 7.1. 二叉树: chapter_tree/binary_tree.md
|
||||
- 7.2. 二叉树遍历: chapter_tree/binary_tree_traversal.md
|
||||
|
@ -173,26 +183,30 @@ nav:
|
|||
- 7.4. 二叉搜索树: chapter_tree/binary_search_tree.md
|
||||
- 7.5. AVL 树 *: chapter_tree/avl_tree.md
|
||||
- 7.6. 小结: chapter_tree/summary.md
|
||||
- 8. 堆:
|
||||
- 8. 堆:
|
||||
# [icon: material/family-tree]
|
||||
- chapter_heap/index.md
|
||||
- 8.1. 堆: chapter_heap/heap.md
|
||||
- 8.2. 建堆操作: chapter_heap/build_heap.md
|
||||
- 8.3. Top-K 问题(New): chapter_heap/top_k.md
|
||||
- 8.3. Top-K 问题: chapter_heap/top_k.md
|
||||
- 8.4. 小结: chapter_heap/summary.md
|
||||
- 9. 图:
|
||||
- 9. 图:
|
||||
# [icon: material/graphql]
|
||||
- chapter_graph/index.md
|
||||
- 9.1. 图: chapter_graph/graph.md
|
||||
- 9.2. 图基础操作: chapter_graph/graph_operations.md
|
||||
- 9.3. 图的遍历: chapter_graph/graph_traversal.md
|
||||
- 9.4. 小结: chapter_graph/summary.md
|
||||
- 10. 搜索:
|
||||
- 10. 搜索:
|
||||
# [icon: material/text-search]
|
||||
- chapter_searching/index.md
|
||||
- 10.1. 二分查找: chapter_searching/binary_search.md
|
||||
- 10.2. 二分查找边界: chapter_searching/binary_search_edge.md
|
||||
- 10.3. 哈希优化策略: chapter_searching/replace_linear_by_hashing.md
|
||||
- 10.4. 重识搜索算法: chapter_searching/searching_algorithm_revisited.md
|
||||
- 10.5. 小结: chapter_searching/summary.md
|
||||
- 11. 排序:
|
||||
- 11. 排序:
|
||||
# [icon: material/sort-ascending]
|
||||
- chapter_sorting/index.md
|
||||
- 11.1. 排序算法: chapter_sorting/sorting_algorithm.md
|
||||
- 11.2. 选择排序: chapter_sorting/selection_sort.md
|
||||
|
@ -205,29 +219,45 @@ nav:
|
|||
- 11.9. 计数排序: chapter_sorting/counting_sort.md
|
||||
- 11.10. 基数排序: chapter_sorting/radix_sort.md
|
||||
- 11.11. 小结: chapter_sorting/summary.md
|
||||
- 12. 分治:
|
||||
- 12. 分治:
|
||||
# [icon: material/file-tree-outline]
|
||||
- chapter_divide_and_conquer/index.md
|
||||
- 12.1. 分治算法(New): chapter_divide_and_conquer/divide_and_conquer.md
|
||||
- 12.2. 分治搜索策略(New): chapter_divide_and_conquer/binary_search_recur.md
|
||||
- 12.3. 构建树问题(New): chapter_divide_and_conquer/build_binary_tree_problem.md
|
||||
- 12.4. 汉诺塔问题(New): chapter_divide_and_conquer/hanota_problem.md
|
||||
- 13. 回溯:
|
||||
# [status: new]
|
||||
- 12.1. 分治算法: chapter_divide_and_conquer/divide_and_conquer.md
|
||||
# [status: new]
|
||||
- 12.2. 分治搜索策略: chapter_divide_and_conquer/binary_search_recur.md
|
||||
# [status: new]
|
||||
- 12.3. 构建树问题: chapter_divide_and_conquer/build_binary_tree_problem.md
|
||||
# [status: new]
|
||||
- 12.4. 汉诺塔问题: chapter_divide_and_conquer/hanota_problem.md
|
||||
- 13. 回溯:
|
||||
# [icon: material/map-marker-path]
|
||||
- chapter_backtracking/index.md
|
||||
- 13.1. 回溯算法: chapter_backtracking/backtracking_algorithm.md
|
||||
- 13.2. 全排列问题: chapter_backtracking/permutations_problem.md
|
||||
- 13.3. 子集和问题: chapter_backtracking/subset_sum_problem.md
|
||||
- 13.4. N 皇后问题: chapter_backtracking/n_queens_problem.md
|
||||
- 13.5. 小结: chapter_backtracking/summary.md
|
||||
- 14. 动态规划:
|
||||
- 14. 动态规划:
|
||||
# [icon: material/table-pivot]
|
||||
- chapter_dynamic_programming/index.md
|
||||
- 14.1. 初探动态规划(New): chapter_dynamic_programming/intro_to_dynamic_programming.md
|
||||
- 14.2. DP 问题特性(New): chapter_dynamic_programming/dp_problem_features.md
|
||||
- 14.3. DP 解题思路(New): chapter_dynamic_programming/dp_solution_pipeline.md
|
||||
- 14.4. 0-1 背包问题(New): chapter_dynamic_programming/knapsack_problem.md
|
||||
- 14.5. 完全背包问题(New): chapter_dynamic_programming/unbounded_knapsack_problem.md
|
||||
- 14.6. 编辑距离问题(New): chapter_dynamic_programming/edit_distance_problem.md
|
||||
- 14.7. 小结(New): chapter_dynamic_programming/summary.md
|
||||
- 15. 附录:
|
||||
# [status: new]
|
||||
- 14.1. 初探动态规划: chapter_dynamic_programming/intro_to_dynamic_programming.md
|
||||
# [status: new]
|
||||
- 14.2. DP 问题特性: chapter_dynamic_programming/dp_problem_features.md
|
||||
# [status: new]
|
||||
- 14.3. DP 解题思路: chapter_dynamic_programming/dp_solution_pipeline.md
|
||||
# [status: new]
|
||||
- 14.4. 0-1 背包问题: chapter_dynamic_programming/knapsack_problem.md
|
||||
# [status: new]
|
||||
- 14.5. 完全背包问题: chapter_dynamic_programming/unbounded_knapsack_problem.md
|
||||
# [status: new]
|
||||
- 14.6. 编辑距离问题: chapter_dynamic_programming/edit_distance_problem.md
|
||||
# [status: new]
|
||||
- 14.7. 小结: chapter_dynamic_programming/summary.md
|
||||
- 15. 附录:
|
||||
# [icon: material/help-circle-outline]
|
||||
- chapter_appendix/index.md
|
||||
- 15.1. 编程环境安装: chapter_appendix/installation.md
|
||||
- 15.2. 一起参与创作: chapter_appendix/contribution.md
|
||||
- 参考文献:
|
||||
|
|
Loading…
Reference in a new issue