From aea68142f8cf2349ef5ade14333188ca59156f2c Mon Sep 17 00:00:00 2001 From: krahets Date: Sun, 7 Apr 2024 02:41:53 +0800 Subject: [PATCH] build --- docs/chapter_appendix/index.md | 6 ++--- docs/chapter_array_and_linkedlist/index.md | 10 ++++---- docs/chapter_backtracking/index.md | 10 ++++---- .../chapter_computational_complexity/index.md | 10 ++++---- docs/chapter_data_structure/index.md | 10 ++++---- docs/chapter_divide_and_conquer/index.md | 10 ++++---- docs/chapter_dynamic_programming/index.md | 14 +++++------ docs/chapter_graph/index.md | 8 +++---- docs/chapter_greedy/index.md | 10 ++++---- docs/chapter_hashing/index.md | 8 +++---- docs/chapter_heap/index.md | 8 +++---- docs/chapter_introduction/index.md | 6 ++--- docs/chapter_preface/index.md | 6 ++--- docs/chapter_searching/index.md | 12 +++++----- docs/chapter_sorting/index.md | 22 ++++++++--------- docs/chapter_stack_and_queue/index.md | 8 +++---- docs/chapter_tree/index.md | 12 +++++----- en/docs/chapter_array_and_linkedlist/index.md | 12 +++++----- .../chapter_computational_complexity/index.md | 12 +++++----- en/docs/chapter_data_structure/index.md | 12 +++++----- en/docs/chapter_graph/index.md | 10 ++++---- en/docs/chapter_hashing/index.md | 10 ++++---- en/docs/chapter_heap/index.md | 10 ++++---- en/docs/chapter_introduction/index.md | 8 +++---- en/docs/chapter_preface/index.md | 8 +++---- en/docs/chapter_stack_and_queue/index.md | 10 ++++---- en/docs/chapter_tree/index.md | 14 +++++------ zh-Hant/docs/chapter_appendix/index.md | 8 +++---- .../chapter_array_and_linkedlist/index.md | 12 +++++----- zh-Hant/docs/chapter_backtracking/index.md | 12 +++++----- .../chapter_computational_complexity/index.md | 12 +++++----- zh-Hant/docs/chapter_data_structure/index.md | 12 +++++----- .../docs/chapter_divide_and_conquer/index.md | 12 +++++----- .../docs/chapter_dynamic_programming/index.md | 16 ++++++------- zh-Hant/docs/chapter_graph/index.md | 10 ++++---- zh-Hant/docs/chapter_greedy/index.md | 12 +++++----- zh-Hant/docs/chapter_hashing/index.md | 10 ++++---- zh-Hant/docs/chapter_heap/index.md | 10 ++++---- zh-Hant/docs/chapter_introduction/index.md | 8 +++---- zh-Hant/docs/chapter_preface/index.md | 8 +++---- zh-Hant/docs/chapter_searching/index.md | 14 +++++------ zh-Hant/docs/chapter_sorting/index.md | 24 +++++++++---------- zh-Hant/docs/chapter_stack_and_queue/index.md | 10 ++++---- zh-Hant/docs/chapter_tree/index.md | 14 +++++------ zh-Hant/docs/index.html | 4 ++-- 45 files changed, 242 insertions(+), 242 deletions(-) diff --git a/docs/chapter_appendix/index.md b/docs/chapter_appendix/index.md index d7f35ec58..81a11b815 100644 --- a/docs/chapter_appendix/index.md +++ b/docs/chapter_appendix/index.md @@ -9,6 +9,6 @@ icon: material/help-circle-outline ## 本章内容 -- [16.1   编程环境安装](https://www.hello-algo.com/chapter_appendix/installation/) -- [16.2   一起参与创作](https://www.hello-algo.com/chapter_appendix/contribution/) -- [16.3   术语表](https://www.hello-algo.com/chapter_appendix/terminology/) +- [16.1   编程环境安装](installation.md) +- [16.2   一起参与创作](contribution.md) +- [16.3   术语表](terminology.md) diff --git a/docs/chapter_array_and_linkedlist/index.md b/docs/chapter_array_and_linkedlist/index.md index ff6081741..a1cdfd0b8 100644 --- a/docs/chapter_array_and_linkedlist/index.md +++ b/docs/chapter_array_and_linkedlist/index.md @@ -15,8 +15,8 @@ icon: material/view-list-outline ## 本章内容 -- [4.1   数组](https://www.hello-algo.com/chapter_array_and_linkedlist/array/) -- [4.2   链表](https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/) -- [4.3   列表](https://www.hello-algo.com/chapter_array_and_linkedlist/list/) -- [4.4   内存与缓存 *](https://www.hello-algo.com/chapter_array_and_linkedlist/ram_and_cache/) -- [4.5   小结](https://www.hello-algo.com/chapter_array_and_linkedlist/summary/) +- [4.1   数组](array.md) +- [4.2   链表](linked_list.md) +- [4.3   列表](list.md) +- [4.4   内存与缓存 *](ram_and_cache.md) +- [4.5   小结](summary.md) diff --git a/docs/chapter_backtracking/index.md b/docs/chapter_backtracking/index.md index 43342b5d6..d6c5e1936 100644 --- a/docs/chapter_backtracking/index.md +++ b/docs/chapter_backtracking/index.md @@ -15,8 +15,8 @@ icon: material/map-marker-path ## 本章内容 -- [13.1   回溯算法](https://www.hello-algo.com/chapter_backtracking/backtracking_algorithm/) -- [13.2   全排列问题](https://www.hello-algo.com/chapter_backtracking/permutations_problem/) -- [13.3   子集和问题](https://www.hello-algo.com/chapter_backtracking/subset_sum_problem/) -- [13.4   N 皇后问题](https://www.hello-algo.com/chapter_backtracking/n_queens_problem/) -- [13.5   小结](https://www.hello-algo.com/chapter_backtracking/summary/) +- [13.1   回溯算法](backtracking_algorithm.md) +- [13.2   全排列问题](permutations_problem.md) +- [13.3   子集和问题](subset_sum_problem.md) +- [13.4   N 皇后问题](n_queens_problem.md) +- [13.5   小结](summary.md) diff --git a/docs/chapter_computational_complexity/index.md b/docs/chapter_computational_complexity/index.md index 4a0d7a5cd..b74410df5 100644 --- a/docs/chapter_computational_complexity/index.md +++ b/docs/chapter_computational_complexity/index.md @@ -15,8 +15,8 @@ icon: material/timer-sand ## 本章内容 -- [2.1   算法效率评估](https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/) -- [2.2   迭代与递归](https://www.hello-algo.com/chapter_computational_complexity/iteration_and_recursion/) -- [2.3   时间复杂度](https://www.hello-algo.com/chapter_computational_complexity/time_complexity/) -- [2.4   空间复杂度](https://www.hello-algo.com/chapter_computational_complexity/space_complexity/) -- [2.5   小结](https://www.hello-algo.com/chapter_computational_complexity/summary/) +- [2.1   算法效率评估](performance_evaluation.md) +- [2.2   迭代与递归](iteration_and_recursion.md) +- [2.3   时间复杂度](time_complexity.md) +- [2.4   空间复杂度](space_complexity.md) +- [2.5   小结](summary.md) diff --git a/docs/chapter_data_structure/index.md b/docs/chapter_data_structure/index.md index 440dac468..e64a926c7 100644 --- a/docs/chapter_data_structure/index.md +++ b/docs/chapter_data_structure/index.md @@ -15,8 +15,8 @@ icon: material/shape-outline ## 本章内容 -- [3.1   数据结构分类](https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/) -- [3.2   基本数据类型](https://www.hello-algo.com/chapter_data_structure/basic_data_types/) -- [3.3   数字编码 *](https://www.hello-algo.com/chapter_data_structure/number_encoding/) -- [3.4   字符编码 *](https://www.hello-algo.com/chapter_data_structure/character_encoding/) -- [3.5   小结](https://www.hello-algo.com/chapter_data_structure/summary/) +- [3.1   数据结构分类](classification_of_data_structure.md) +- [3.2   基本数据类型](basic_data_types.md) +- [3.3   数字编码 *](number_encoding.md) +- [3.4   字符编码 *](character_encoding.md) +- [3.5   小结](summary.md) diff --git a/docs/chapter_divide_and_conquer/index.md b/docs/chapter_divide_and_conquer/index.md index 6ee3a06c3..71d90b257 100644 --- a/docs/chapter_divide_and_conquer/index.md +++ b/docs/chapter_divide_and_conquer/index.md @@ -15,8 +15,8 @@ icon: material/set-split ## 本章内容 -- [12.1   分治算法](https://www.hello-algo.com/chapter_divide_and_conquer/divide_and_conquer/) -- [12.2   分治搜索策略](https://www.hello-algo.com/chapter_divide_and_conquer/binary_search_recur/) -- [12.3   构建树问题](https://www.hello-algo.com/chapter_divide_and_conquer/build_binary_tree_problem/) -- [12.4   汉诺塔问题](https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/) -- [12.5   小结](https://www.hello-algo.com/chapter_divide_and_conquer/summary/) +- [12.1   分治算法](divide_and_conquer.md) +- [12.2   分治搜索策略](binary_search_recur.md) +- [12.3   构建树问题](build_binary_tree_problem.md) +- [12.4   汉诺塔问题](hanota_problem.md) +- [12.5   小结](summary.md) diff --git a/docs/chapter_dynamic_programming/index.md b/docs/chapter_dynamic_programming/index.md index 5bed2aaba..12b9d350d 100644 --- a/docs/chapter_dynamic_programming/index.md +++ b/docs/chapter_dynamic_programming/index.md @@ -15,10 +15,10 @@ icon: material/table-pivot ## 本章内容 -- [14.1   初探动态规划](https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/) -- [14.2   DP 问题特性](https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/) -- [14.3   DP 解题思路](https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/) -- [14.4   0-1 背包问题](https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/) -- [14.5   完全背包问题](https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/) -- [14.6   编辑距离问题](https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/) -- [14.7   小结](https://www.hello-algo.com/chapter_dynamic_programming/summary/) +- [14.1   初探动态规划](intro_to_dynamic_programming.md) +- [14.2   DP 问题特性](dp_problem_features.md) +- [14.3   DP 解题思路](dp_solution_pipeline.md) +- [14.4   0-1 背包问题](knapsack_problem.md) +- [14.5   完全背包问题](unbounded_knapsack_problem.md) +- [14.6   编辑距离问题](edit_distance_problem.md) +- [14.7   小结](summary.md) diff --git a/docs/chapter_graph/index.md b/docs/chapter_graph/index.md index f7343b740..8abb5b8a9 100644 --- a/docs/chapter_graph/index.md +++ b/docs/chapter_graph/index.md @@ -15,7 +15,7 @@ icon: material/graphql ## 本章内容 -- [9.1   图](https://www.hello-algo.com/chapter_graph/graph/) -- [9.2   图基础操作](https://www.hello-algo.com/chapter_graph/graph_operations/) -- [9.3   图的遍历](https://www.hello-algo.com/chapter_graph/graph_traversal/) -- [9.4   小结](https://www.hello-algo.com/chapter_graph/summary/) +- [9.1   图](graph.md) +- [9.2   图基础操作](graph_operations.md) +- [9.3   图的遍历](graph_traversal.md) +- [9.4   小结](summary.md) diff --git a/docs/chapter_greedy/index.md b/docs/chapter_greedy/index.md index dd7148f3b..020b72e30 100644 --- a/docs/chapter_greedy/index.md +++ b/docs/chapter_greedy/index.md @@ -15,8 +15,8 @@ icon: material/head-heart-outline ## 本章内容 -- [15.1   贪心算法](https://www.hello-algo.com/chapter_greedy/greedy_algorithm/) -- [15.2   分数背包问题](https://www.hello-algo.com/chapter_greedy/fractional_knapsack_problem/) -- [15.3   最大容量问题](https://www.hello-algo.com/chapter_greedy/max_capacity_problem/) -- [15.4   最大切分乘积问题](https://www.hello-algo.com/chapter_greedy/max_product_cutting_problem/) -- [15.5   小结](https://www.hello-algo.com/chapter_greedy/summary/) +- [15.1   贪心算法](greedy_algorithm.md) +- [15.2   分数背包问题](fractional_knapsack_problem.md) +- [15.3   最大容量问题](max_capacity_problem.md) +- [15.4   最大切分乘积问题](max_product_cutting_problem.md) +- [15.5   小结](summary.md) diff --git a/docs/chapter_hashing/index.md b/docs/chapter_hashing/index.md index 43fc5a603..3ddfc0ea0 100644 --- a/docs/chapter_hashing/index.md +++ b/docs/chapter_hashing/index.md @@ -15,7 +15,7 @@ icon: material/table-search ## 本章内容 -- [6.1   哈希表](https://www.hello-algo.com/chapter_hashing/hash_map/) -- [6.2   哈希冲突](https://www.hello-algo.com/chapter_hashing/hash_collision/) -- [6.3   哈希算法](https://www.hello-algo.com/chapter_hashing/hash_algorithm/) -- [6.4   小结](https://www.hello-algo.com/chapter_hashing/summary/) +- [6.1   哈希表](hash_map.md) +- [6.2   哈希冲突](hash_collision.md) +- [6.3   哈希算法](hash_algorithm.md) +- [6.4   小结](summary.md) diff --git a/docs/chapter_heap/index.md b/docs/chapter_heap/index.md index b88d3d8ea..d72e2aebe 100644 --- a/docs/chapter_heap/index.md +++ b/docs/chapter_heap/index.md @@ -15,7 +15,7 @@ icon: material/family-tree ## 本章内容 -- [8.1   堆](https://www.hello-algo.com/chapter_heap/heap/) -- [8.2   建堆操作](https://www.hello-algo.com/chapter_heap/build_heap/) -- [8.3   Top-k 问题](https://www.hello-algo.com/chapter_heap/top_k/) -- [8.4   小结](https://www.hello-algo.com/chapter_heap/summary/) +- [8.1   堆](heap.md) +- [8.2   建堆操作](build_heap.md) +- [8.3   Top-k 问题](top_k.md) +- [8.4   小结](summary.md) diff --git a/docs/chapter_introduction/index.md b/docs/chapter_introduction/index.md index 9688a0ded..b81d6ed42 100644 --- a/docs/chapter_introduction/index.md +++ b/docs/chapter_introduction/index.md @@ -15,6 +15,6 @@ icon: material/calculator-variant-outline ## 本章内容 -- [1.1   算法无处不在](https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/) -- [1.2   算法是什么](https://www.hello-algo.com/chapter_introduction/what_is_dsa/) -- [1.3   小结](https://www.hello-algo.com/chapter_introduction/summary/) +- [1.1   算法无处不在](algorithms_are_everywhere.md) +- [1.2   算法是什么](what_is_dsa.md) +- [1.3   小结](summary.md) diff --git a/docs/chapter_preface/index.md b/docs/chapter_preface/index.md index f8c2aec3d..fb45cd86d 100644 --- a/docs/chapter_preface/index.md +++ b/docs/chapter_preface/index.md @@ -15,6 +15,6 @@ icon: material/book-open-outline ## 本章内容 -- [0.1   关于本书](https://www.hello-algo.com/chapter_preface/about_the_book/) -- [0.2   如何使用本书](https://www.hello-algo.com/chapter_preface/suggestions/) -- [0.3   小结](https://www.hello-algo.com/chapter_preface/summary/) +- [0.1   关于本书](about_the_book.md) +- [0.2   如何使用本书](suggestions.md) +- [0.3   小结](summary.md) diff --git a/docs/chapter_searching/index.md b/docs/chapter_searching/index.md index 8d2fcb0f8..d2e9d75b6 100644 --- a/docs/chapter_searching/index.md +++ b/docs/chapter_searching/index.md @@ -15,9 +15,9 @@ icon: material/text-search ## 本章内容 -- [10.1   二分查找](https://www.hello-algo.com/chapter_searching/binary_search/) -- [10.2   二分查找插入点](https://www.hello-algo.com/chapter_searching/binary_search_insertion/) -- [10.3   二分查找边界](https://www.hello-algo.com/chapter_searching/binary_search_edge/) -- [10.4   哈希优化策略](https://www.hello-algo.com/chapter_searching/replace_linear_by_hashing/) -- [10.5   重识搜索算法](https://www.hello-algo.com/chapter_searching/searching_algorithm_revisited/) -- [10.6   小结](https://www.hello-algo.com/chapter_searching/summary/) +- [10.1   二分查找](binary_search.md) +- [10.2   二分查找插入点](binary_search_insertion.md) +- [10.3   二分查找边界](binary_search_edge.md) +- [10.4   哈希优化策略](replace_linear_by_hashing.md) +- [10.5   重识搜索算法](searching_algorithm_revisited.md) +- [10.6   小结](summary.md) diff --git a/docs/chapter_sorting/index.md b/docs/chapter_sorting/index.md index 69a542a7c..28a328a4b 100644 --- a/docs/chapter_sorting/index.md +++ b/docs/chapter_sorting/index.md @@ -15,14 +15,14 @@ icon: material/sort-ascending ## 本章内容 -- [11.1   排序算法](https://www.hello-algo.com/chapter_sorting/sorting_algorithm/) -- [11.2   选择排序](https://www.hello-algo.com/chapter_sorting/selection_sort/) -- [11.3   冒泡排序](https://www.hello-algo.com/chapter_sorting/bubble_sort/) -- [11.4   插入排序](https://www.hello-algo.com/chapter_sorting/insertion_sort/) -- [11.5   快速排序](https://www.hello-algo.com/chapter_sorting/quick_sort/) -- [11.6   归并排序](https://www.hello-algo.com/chapter_sorting/merge_sort/) -- [11.7   堆排序](https://www.hello-algo.com/chapter_sorting/heap_sort/) -- [11.8   桶排序](https://www.hello-algo.com/chapter_sorting/bucket_sort/) -- [11.9   计数排序](https://www.hello-algo.com/chapter_sorting/counting_sort/) -- [11.10   基数排序](https://www.hello-algo.com/chapter_sorting/radix_sort/) -- [11.11   小结](https://www.hello-algo.com/chapter_sorting/summary/) +- [11.1   排序算法](sorting_algorithm.md) +- [11.2   选择排序](selection_sort.md) +- [11.3   冒泡排序](bubble_sort.md) +- [11.4   插入排序](insertion_sort.md) +- [11.5   快速排序](quick_sort.md) +- [11.6   归并排序](merge_sort.md) +- [11.7   堆排序](heap_sort.md) +- [11.8   桶排序](bucket_sort.md) +- [11.9   计数排序](counting_sort.md) +- [11.10   基数排序](radix_sort.md) +- [11.11   小结](summary.md) diff --git a/docs/chapter_stack_and_queue/index.md b/docs/chapter_stack_and_queue/index.md index 05db5e5c4..6a414509b 100644 --- a/docs/chapter_stack_and_queue/index.md +++ b/docs/chapter_stack_and_queue/index.md @@ -15,7 +15,7 @@ icon: material/stack-overflow ## 本章内容 -- [5.1   栈](https://www.hello-algo.com/chapter_stack_and_queue/stack/) -- [5.2   队列](https://www.hello-algo.com/chapter_stack_and_queue/queue/) -- [5.3   双向队列](https://www.hello-algo.com/chapter_stack_and_queue/deque/) -- [5.4   小结](https://www.hello-algo.com/chapter_stack_and_queue/summary/) +- [5.1   栈](stack.md) +- [5.2   队列](queue.md) +- [5.3   双向队列](deque.md) +- [5.4   小结](summary.md) diff --git a/docs/chapter_tree/index.md b/docs/chapter_tree/index.md index 3a6012819..aa938d11d 100644 --- a/docs/chapter_tree/index.md +++ b/docs/chapter_tree/index.md @@ -15,9 +15,9 @@ icon: material/graph-outline ## 本章内容 -- [7.1   二叉树](https://www.hello-algo.com/chapter_tree/binary_tree/) -- [7.2   二叉树遍历](https://www.hello-algo.com/chapter_tree/binary_tree_traversal/) -- [7.3   二叉树数组表示](https://www.hello-algo.com/chapter_tree/array_representation_of_tree/) -- [7.4   二叉搜索树](https://www.hello-algo.com/chapter_tree/binary_search_tree/) -- [7.5   AVL 树 *](https://www.hello-algo.com/chapter_tree/avl_tree/) -- [7.6   小结](https://www.hello-algo.com/chapter_tree/summary/) +- [7.1   二叉树](binary_tree.md) +- [7.2   二叉树遍历](binary_tree_traversal.md) +- [7.3   二叉树数组表示](array_representation_of_tree.md) +- [7.4   二叉搜索树](binary_search_tree.md) +- [7.5   AVL 树 *](avl_tree.md) +- [7.6   小结](summary.md) diff --git a/en/docs/chapter_array_and_linkedlist/index.md b/en/docs/chapter_array_and_linkedlist/index.md index 77bd560c5..9a34cb915 100644 --- a/en/docs/chapter_array_and_linkedlist/index.md +++ b/en/docs/chapter_array_and_linkedlist/index.md @@ -13,10 +13,10 @@ icon: material/view-list-outline In arrays, envision bricks snugly aligned, each resting seamlessly beside the next, creating a unified formation. Meanwhile, in linked lists, these bricks disperse freely, embraced by vines gracefully knitting connections between them. -## Chapter Contents +## Chapter contents -- [4.1   Array](https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/) -- [4.2   Linked list](https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/) -- [4.3   List](https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/) -- [4.4   Memory and cache](https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/) -- [4.5   Summary](https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/) +- [4.1   Array](array.md) +- [4.2   Linked list](linked_list.md) +- [4.3   List](list.md) +- [4.4   Memory and cache](ram_and_cache.md) +- [4.5   Summary](summary.md) diff --git a/en/docs/chapter_computational_complexity/index.md b/en/docs/chapter_computational_complexity/index.md index 271507406..29b602632 100644 --- a/en/docs/chapter_computational_complexity/index.md +++ b/en/docs/chapter_computational_complexity/index.md @@ -13,10 +13,10 @@ icon: material/timer-sand It guides us in exploring deeper within the the dimensions of time and space, seeking more elegant solutions. -## Chapter Contents +## Chapter contents -- [2.1   Algorithm efficiency assessment](https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/) -- [2.2   Iteration and recursion](https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/) -- [2.3   Time complexity](https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/) -- [2.4   Space complexity](https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/) -- [2.5   Summary](https://www.hello-algo.com/en/chapter_computational_complexity/summary/) +- [2.1   Algorithm efficiency assessment](performance_evaluation.md) +- [2.2   Iteration and recursion](iteration_and_recursion.md) +- [2.3   Time complexity](time_complexity.md) +- [2.4   Space complexity](space_complexity.md) +- [2.5   Summary](summary.md) diff --git a/en/docs/chapter_data_structure/index.md b/en/docs/chapter_data_structure/index.md index b3a84f25e..5b8f4bcce 100644 --- a/en/docs/chapter_data_structure/index.md +++ b/en/docs/chapter_data_structure/index.md @@ -13,10 +13,10 @@ icon: material/shape-outline They offer a blueprint for the orderly organization of data, upon which algorithms come to life. -## Chapter Contents +## Chapter contents -- [3.1   Classification of data structures](https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/) -- [3.2   Fundamental data types](https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/) -- [3.3   Number encoding *](https://www.hello-algo.com/en/chapter_data_structure/number_encoding/) -- [3.4   Character encoding *](https://www.hello-algo.com/en/chapter_data_structure/character_encoding/) -- [3.5   Summary](https://www.hello-algo.com/en/chapter_data_structure/summary/) +- [3.1   Classification of data structures](classification_of_data_structure.md) +- [3.2   Fundamental data types](basic_data_types.md) +- [3.3   Number encoding *](number_encoding.md) +- [3.4   Character encoding *](character_encoding.md) +- [3.5   Summary](summary.md) diff --git a/en/docs/chapter_graph/index.md b/en/docs/chapter_graph/index.md index 095d4b309..79192e6f8 100644 --- a/en/docs/chapter_graph/index.md +++ b/en/docs/chapter_graph/index.md @@ -13,9 +13,9 @@ icon: material/graphql Every encountering and parting leaves a unique mark on this vast network graph. -## Chapter Contents +## Chapter contents -- [9.1   Graph](https://www.hello-algo.com/en/chapter_graph/graph/) -- [9.2   Basic Graph Operations](https://www.hello-algo.com/en/chapter_graph/graph_operations/) -- [9.3   Graph Traversal](https://www.hello-algo.com/en/chapter_graph/graph_traversal/) -- [9.4   Summary](https://www.hello-algo.com/en/chapter_graph/summary/) +- [9.1   Graph](graph.md) +- [9.2   Basic Graph Operations](graph_operations.md) +- [9.3   Graph Traversal](graph_traversal.md) +- [9.4   Summary](summary.md) diff --git a/en/docs/chapter_hashing/index.md b/en/docs/chapter_hashing/index.md index 0e9bd5f36..42bb5a431 100644 --- a/en/docs/chapter_hashing/index.md +++ b/en/docs/chapter_hashing/index.md @@ -13,9 +13,9 @@ icon: material/table-search It understands how to compute index numbers, enabling swift retrieval of the desired book. -## Chapter Contents +## Chapter contents -- [6.1   Hash table](https://www.hello-algo.com/en/chapter_hashing/hash_map/) -- [6.2   Hash collision](https://www.hello-algo.com/en/chapter_hashing/hash_collision/) -- [6.3   Hash algorithm](https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/) -- [6.4   Summary](https://www.hello-algo.com/en/chapter_hashing/summary/) +- [6.1   Hash table](hash_map.md) +- [6.2   Hash collision](hash_collision.md) +- [6.3   Hash algorithm](hash_algorithm.md) +- [6.4   Summary](summary.md) diff --git a/en/docs/chapter_heap/index.md b/en/docs/chapter_heap/index.md index 55c022d03..b56500902 100644 --- a/en/docs/chapter_heap/index.md +++ b/en/docs/chapter_heap/index.md @@ -13,9 +13,9 @@ icon: material/family-tree Among these peaks, the highest one always catches the eye first. -## Chapter Contents +## Chapter contents -- [8.1   Heap](https://www.hello-algo.com/en/chapter_heap/heap/) -- [8.2   Building a Heap](https://www.hello-algo.com/en/chapter_heap/build_heap/) -- [8.3   Top-k Problem](https://www.hello-algo.com/en/chapter_heap/top_k/) -- [8.4   Summary](https://www.hello-algo.com/en/chapter_heap/summary/) +- [8.1   Heap](heap.md) +- [8.2   Building a Heap](build_heap.md) +- [8.3   Top-k Problem](top_k.md) +- [8.4   Summary](summary.md) diff --git a/en/docs/chapter_introduction/index.md b/en/docs/chapter_introduction/index.md index 6274b38a0..95325ba6b 100644 --- a/en/docs/chapter_introduction/index.md +++ b/en/docs/chapter_introduction/index.md @@ -13,8 +13,8 @@ icon: material/calculator-variant-outline She invites you to a dance, follow her steps, and enter the world of algorithms full of logic and beauty. -## Chapter Contents +## Chapter contents -- [1.1   Algorithms are everywhere](https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/) -- [1.2   What is an algorithm](https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/) -- [1.3   Summary](https://www.hello-algo.com/en/chapter_introduction/summary/) +- [1.1   Algorithms are everywhere](algorithms_are_everywhere.md) +- [1.2   What is an algorithm](what_is_dsa.md) +- [1.3   Summary](summary.md) diff --git a/en/docs/chapter_preface/index.md b/en/docs/chapter_preface/index.md index 5d285a50c..62bf95bb7 100644 --- a/en/docs/chapter_preface/index.md +++ b/en/docs/chapter_preface/index.md @@ -13,8 +13,8 @@ icon: material/book-open-outline May this book ring softly in your mind, leaving a unique and profound melody. -## Chapter Contents +## Chapter contents -- [0.1   About this book](https://www.hello-algo.com/en/chapter_preface/about_the_book/) -- [0.2   How to read](https://www.hello-algo.com/en/chapter_preface/suggestions/) -- [0.3   Summary](https://www.hello-algo.com/en/chapter_preface/summary/) +- [0.1   About this book](about_the_book.md) +- [0.2   How to read](suggestions.md) +- [0.3   Summary](summary.md) diff --git a/en/docs/chapter_stack_and_queue/index.md b/en/docs/chapter_stack_and_queue/index.md index 746f3ed54..d2131bfe6 100644 --- a/en/docs/chapter_stack_and_queue/index.md +++ b/en/docs/chapter_stack_and_queue/index.md @@ -13,9 +13,9 @@ icon: material/stack-overflow They represent the logical relationships of Last-In-First-Out (LIFO) and First-In-First-Out (FIFO), respectively. -## Chapter Contents +## Chapter contents -- [5.1   Stack](https://www.hello-algo.com/en/chapter_stack_and_queue/stack/) -- [5.2   Queue](https://www.hello-algo.com/en/chapter_stack_and_queue/queue/) -- [5.3   Double-ended queue](https://www.hello-algo.com/en/chapter_stack_and_queue/deque/) -- [5.4   Summary](https://www.hello-algo.com/en/chapter_stack_and_queue/summary/) +- [5.1   Stack](stack.md) +- [5.2   Queue](queue.md) +- [5.3   Double-ended queue](deque.md) +- [5.4   Summary](summary.md) diff --git a/en/docs/chapter_tree/index.md b/en/docs/chapter_tree/index.md index a5d1da56c..d796b5e3e 100644 --- a/en/docs/chapter_tree/index.md +++ b/en/docs/chapter_tree/index.md @@ -13,11 +13,11 @@ icon: material/graph-outline It vividly demonstrates the form of data divide-and-conquer. -## Chapter Contents +## Chapter contents -- [7.1   Binary Tree](https://www.hello-algo.com/en/chapter_tree/binary_tree/) -- [7.2   Binary Tree Traversal](https://www.hello-algo.com/en/chapter_tree/binary_tree_traversal/) -- [7.3   Array Representation of Tree](https://www.hello-algo.com/en/chapter_tree/array_representation_of_tree/) -- [7.4   Binary Search Tree](https://www.hello-algo.com/en/chapter_tree/binary_search_tree/) -- [7.5   AVL Tree *](https://www.hello-algo.com/en/chapter_tree/avl_tree/) -- [7.6   Summary](https://www.hello-algo.com/en/chapter_tree/summary/) +- [7.1   Binary Tree](binary_tree.md) +- [7.2   Binary Tree Traversal](binary_tree_traversal.md) +- [7.3   Array Representation of Tree](array_representation_of_tree.md) +- [7.4   Binary Search Tree](binary_search_tree.md) +- [7.5   AVL Tree *](avl_tree.md) +- [7.6   Summary](summary.md) diff --git a/zh-Hant/docs/chapter_appendix/index.md b/zh-Hant/docs/chapter_appendix/index.md index f5149e85c..d78239c04 100644 --- a/zh-Hant/docs/chapter_appendix/index.md +++ b/zh-Hant/docs/chapter_appendix/index.md @@ -7,8 +7,8 @@ icon: material/help-circle-outline ![附錄](../assets/covers/chapter_appendix.jpg){ class="cover-image" } -## Chapter Contents +## 本章內容 -- [16.1   程式設計環境安裝](https://www.hello-algo.com/en/chapter_appendix/installation/) -- [16.2   一起參與創作](https://www.hello-algo.com/en/chapter_appendix/contribution/) -- [16.3   術語表](https://www.hello-algo.com/en/chapter_appendix/terminology/) +- [16.1   程式設計環境安裝](installation.md) +- [16.2   一起參與創作](contribution.md) +- [16.3   術語表](terminology.md) diff --git a/zh-Hant/docs/chapter_array_and_linkedlist/index.md b/zh-Hant/docs/chapter_array_and_linkedlist/index.md index 1b2e6c964..1d00c0f66 100644 --- a/zh-Hant/docs/chapter_array_and_linkedlist/index.md +++ b/zh-Hant/docs/chapter_array_and_linkedlist/index.md @@ -13,10 +13,10 @@ icon: material/view-list-outline 陣列的磚塊整齊排列，逐個緊貼。鏈結串列的磚塊分散各處，連線的藤蔓自由地穿梭於磚縫之間。 -## Chapter Contents +## 本章內容 -- [4.1   陣列](https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/) -- [4.2   鏈結串列](https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/) -- [4.3   串列](https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/) -- [4.4   記憶體與快取 *](https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/) -- [4.5   小結](https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/) +- [4.1   陣列](array.md) +- [4.2   鏈結串列](linked_list.md) +- [4.3   串列](list.md) +- [4.4   記憶體與快取 *](ram_and_cache.md) +- [4.5   小結](summary.md) diff --git a/zh-Hant/docs/chapter_backtracking/index.md b/zh-Hant/docs/chapter_backtracking/index.md index d11076166..66b09b9dd 100644 --- a/zh-Hant/docs/chapter_backtracking/index.md +++ b/zh-Hant/docs/chapter_backtracking/index.md @@ -13,10 +13,10 @@ icon: material/map-marker-path 回溯的力量讓我們能夠重新開始，不斷嘗試，最終找到通往光明的出口。 -## Chapter Contents +## 本章內容 -- [13.1   回溯演算法](https://www.hello-algo.com/en/chapter_backtracking/backtracking_algorithm/) -- [13.2   全排列問題](https://www.hello-algo.com/en/chapter_backtracking/permutations_problem/) -- [13.3   子集和問題](https://www.hello-algo.com/en/chapter_backtracking/subset_sum_problem/) -- [13.4   N 皇后問題](https://www.hello-algo.com/en/chapter_backtracking/n_queens_problem/) -- [13.5   小結](https://www.hello-algo.com/en/chapter_backtracking/summary/) +- [13.1   回溯演算法](backtracking_algorithm.md) +- [13.2   全排列問題](permutations_problem.md) +- [13.3   子集和問題](subset_sum_problem.md) +- [13.4   N 皇后問題](n_queens_problem.md) +- [13.5   小結](summary.md) diff --git a/zh-Hant/docs/chapter_computational_complexity/index.md b/zh-Hant/docs/chapter_computational_complexity/index.md index b3f32664c..8bcfd745b 100644 --- a/zh-Hant/docs/chapter_computational_complexity/index.md +++ b/zh-Hant/docs/chapter_computational_complexity/index.md @@ -13,10 +13,10 @@ icon: material/timer-sand 它帶領我們在時間與空間這兩個維度上深入探索，尋找更優雅的解決方案。 -## Chapter Contents +## 本章內容 -- [2.1   演算法效率評估](https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/) -- [2.2   迭代與遞迴](https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/) -- [2.3   時間複雜度](https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/) -- [2.4   空間複雜度](https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/) -- [2.5   小結](https://www.hello-algo.com/en/chapter_computational_complexity/summary/) +- [2.1   演算法效率評估](performance_evaluation.md) +- [2.2   迭代與遞迴](iteration_and_recursion.md) +- [2.3   時間複雜度](time_complexity.md) +- [2.4   空間複雜度](space_complexity.md) +- [2.5   小結](summary.md) diff --git a/zh-Hant/docs/chapter_data_structure/index.md b/zh-Hant/docs/chapter_data_structure/index.md index 8ec9b5b93..8e0c0d2b3 100644 --- a/zh-Hant/docs/chapter_data_structure/index.md +++ b/zh-Hant/docs/chapter_data_structure/index.md @@ -13,10 +13,10 @@ icon: material/shape-outline 它為資料的有序組織提供了藍圖，演算法得以在此基礎上生動起來。 -## Chapter Contents +## 本章內容 -- [3.1   資料結構分類](https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/) -- [3.2   基本資料型別](https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/) -- [3.3   數字編碼 *](https://www.hello-algo.com/en/chapter_data_structure/number_encoding/) -- [3.4   字元編碼 *](https://www.hello-algo.com/en/chapter_data_structure/character_encoding/) -- [3.5   小結](https://www.hello-algo.com/en/chapter_data_structure/summary/) +- [3.1   資料結構分類](classification_of_data_structure.md) +- [3.2   基本資料型別](basic_data_types.md) +- [3.3   數字編碼 *](number_encoding.md) +- [3.4   字元編碼 *](character_encoding.md) +- [3.5   小結](summary.md) diff --git a/zh-Hant/docs/chapter_divide_and_conquer/index.md b/zh-Hant/docs/chapter_divide_and_conquer/index.md index 2f7838d22..de010e855 100644 --- a/zh-Hant/docs/chapter_divide_and_conquer/index.md +++ b/zh-Hant/docs/chapter_divide_and_conquer/index.md @@ -13,10 +13,10 @@ icon: material/set-split 分而治之揭示了一個重要的事實：從簡單做起，一切都不再複雜。 -## Chapter Contents +## 本章內容 -- [12.1   分治演算法](https://www.hello-algo.com/en/chapter_divide_and_conquer/divide_and_conquer/) -- [12.2   分治搜尋策略](https://www.hello-algo.com/en/chapter_divide_and_conquer/binary_search_recur/) -- [12.3   構建樹問題](https://www.hello-algo.com/en/chapter_divide_and_conquer/build_binary_tree_problem/) -- [12.4   河內塔問題](https://www.hello-algo.com/en/chapter_divide_and_conquer/hanota_problem/) -- [12.5   小結](https://www.hello-algo.com/en/chapter_divide_and_conquer/summary/) +- [12.1   分治演算法](divide_and_conquer.md) +- [12.2   分治搜尋策略](binary_search_recur.md) +- [12.3   構建樹問題](build_binary_tree_problem.md) +- [12.4   河內塔問題](hanota_problem.md) +- [12.5   小結](summary.md) diff --git a/zh-Hant/docs/chapter_dynamic_programming/index.md b/zh-Hant/docs/chapter_dynamic_programming/index.md index 9d365ff0d..94eff4d45 100644 --- a/zh-Hant/docs/chapter_dynamic_programming/index.md +++ b/zh-Hant/docs/chapter_dynamic_programming/index.md @@ -13,12 +13,12 @@ icon: material/table-pivot 動態規劃將小問題的解彙集成大問題的答案，一步步引領我們走向解決問題的彼岸。 -## Chapter Contents +## 本章內容 -- [14.1   初探動態規劃](https://www.hello-algo.com/en/chapter_dynamic_programming/intro_to_dynamic_programming/) -- [14.2   DP 問題特性](https://www.hello-algo.com/en/chapter_dynamic_programming/dp_problem_features/) -- [14.3   DP 解題思路](https://www.hello-algo.com/en/chapter_dynamic_programming/dp_solution_pipeline/) -- [14.4   0-1 背包問題](https://www.hello-algo.com/en/chapter_dynamic_programming/knapsack_problem/) -- [14.5   完全背包問題](https://www.hello-algo.com/en/chapter_dynamic_programming/unbounded_knapsack_problem/) -- [14.6   編輯距離問題](https://www.hello-algo.com/en/chapter_dynamic_programming/edit_distance_problem/) -- [14.7   小結](https://www.hello-algo.com/en/chapter_dynamic_programming/summary/) +- [14.1   初探動態規劃](intro_to_dynamic_programming.md) +- [14.2   DP 問題特性](dp_problem_features.md) +- [14.3   DP 解題思路](dp_solution_pipeline.md) +- [14.4   0-1 背包問題](knapsack_problem.md) +- [14.5   完全背包問題](unbounded_knapsack_problem.md) +- [14.6   編輯距離問題](edit_distance_problem.md) +- [14.7   小結](summary.md) diff --git a/zh-Hant/docs/chapter_graph/index.md b/zh-Hant/docs/chapter_graph/index.md index 7232b25c4..6fb2dc91f 100644 --- a/zh-Hant/docs/chapter_graph/index.md +++ b/zh-Hant/docs/chapter_graph/index.md @@ -13,9 +13,9 @@ icon: material/graphql 每一次的相識與相離，都在這張巨大的網路圖中留下獨特的印記。 -## Chapter Contents +## 本章內容 -- [9.1   圖](https://www.hello-algo.com/en/chapter_graph/graph/) -- [9.2   圖基礎操作](https://www.hello-algo.com/en/chapter_graph/graph_operations/) -- [9.3   圖的走訪](https://www.hello-algo.com/en/chapter_graph/graph_traversal/) -- [9.4   小結](https://www.hello-algo.com/en/chapter_graph/summary/) +- [9.1   圖](graph.md) +- [9.2   圖基礎操作](graph_operations.md) +- [9.3   圖的走訪](graph_traversal.md) +- [9.4   小結](summary.md) diff --git a/zh-Hant/docs/chapter_greedy/index.md b/zh-Hant/docs/chapter_greedy/index.md index 524fa5760..a4af506a7 100644 --- a/zh-Hant/docs/chapter_greedy/index.md +++ b/zh-Hant/docs/chapter_greedy/index.md @@ -13,10 +13,10 @@ icon: material/head-heart-outline 貪婪策略在一輪輪的簡單選擇中，逐步導向最佳答案。 -## Chapter Contents +## 本章內容 -- [15.1   貪婪演算法](https://www.hello-algo.com/en/chapter_greedy/greedy_algorithm/) -- [15.2   分數背包問題](https://www.hello-algo.com/en/chapter_greedy/fractional_knapsack_problem/) -- [15.3   最大容量問題](https://www.hello-algo.com/en/chapter_greedy/max_capacity_problem/) -- [15.4   最大切分乘積問題](https://www.hello-algo.com/en/chapter_greedy/max_product_cutting_problem/) -- [15.5   小結](https://www.hello-algo.com/en/chapter_greedy/summary/) +- [15.1   貪婪演算法](greedy_algorithm.md) +- [15.2   分數背包問題](fractional_knapsack_problem.md) +- [15.3   最大容量問題](max_capacity_problem.md) +- [15.4   最大切分乘積問題](max_product_cutting_problem.md) +- [15.5   小結](summary.md) diff --git a/zh-Hant/docs/chapter_hashing/index.md b/zh-Hant/docs/chapter_hashing/index.md index baa9ff089..299791fd6 100644 --- a/zh-Hant/docs/chapter_hashing/index.md +++ b/zh-Hant/docs/chapter_hashing/index.md @@ -13,9 +13,9 @@ icon: material/table-search 他知道如何計算索書號，從而可以快速找到目標圖書。 -## Chapter Contents +## 本章內容 -- [6.1   雜湊表](https://www.hello-algo.com/en/chapter_hashing/hash_map/) -- [6.2   雜湊衝突](https://www.hello-algo.com/en/chapter_hashing/hash_collision/) -- [6.3   雜湊演算法](https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/) -- [6.4   小結](https://www.hello-algo.com/en/chapter_hashing/summary/) +- [6.1   雜湊表](hash_map.md) +- [6.2   雜湊衝突](hash_collision.md) +- [6.3   雜湊演算法](hash_algorithm.md) +- [6.4   小結](summary.md) diff --git a/zh-Hant/docs/chapter_heap/index.md b/zh-Hant/docs/chapter_heap/index.md index c2d898fb4..4c9581c92 100644 --- a/zh-Hant/docs/chapter_heap/index.md +++ b/zh-Hant/docs/chapter_heap/index.md @@ -13,9 +13,9 @@ icon: material/family-tree 座座山峰高低錯落，而最高的山峰總是最先映入眼簾。 -## Chapter Contents +## 本章內容 -- [8.1   堆積](https://www.hello-algo.com/en/chapter_heap/heap/) -- [8.2   建堆積操作](https://www.hello-algo.com/en/chapter_heap/build_heap/) -- [8.3   Top-k 問題](https://www.hello-algo.com/en/chapter_heap/top_k/) -- [8.4   小結](https://www.hello-algo.com/en/chapter_heap/summary/) +- [8.1   堆積](heap.md) +- [8.2   建堆積操作](build_heap.md) +- [8.3   Top-k 問題](top_k.md) +- [8.4   小結](summary.md) diff --git a/zh-Hant/docs/chapter_introduction/index.md b/zh-Hant/docs/chapter_introduction/index.md index 193a1a54b..79bb4cc47 100644 --- a/zh-Hant/docs/chapter_introduction/index.md +++ b/zh-Hant/docs/chapter_introduction/index.md @@ -13,8 +13,8 @@ icon: material/calculator-variant-outline 她邀請你共舞，請緊跟她的步伐，踏入充滿邏輯與美感的演算法世界。 -## Chapter Contents +## 本章內容 -- [1.1   演算法無處不在](https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/) -- [1.2   演算法是什麼](https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/) -- [1.3   小結](https://www.hello-algo.com/en/chapter_introduction/summary/) +- [1.1   演算法無處不在](algorithms_are_everywhere.md) +- [1.2   演算法是什麼](what_is_dsa.md) +- [1.3   小結](summary.md) diff --git a/zh-Hant/docs/chapter_preface/index.md b/zh-Hant/docs/chapter_preface/index.md index f0cb3a0d9..c6aa2e514 100644 --- a/zh-Hant/docs/chapter_preface/index.md +++ b/zh-Hant/docs/chapter_preface/index.md @@ -13,8 +13,8 @@ icon: material/book-open-outline 願這本書在你的腦海中輕輕響起，留下獨特而深刻的旋律。 -## Chapter Contents +## 本章內容 -- [0.1   關於本書](https://www.hello-algo.com/en/chapter_preface/about_the_book/) -- [0.2   如何使用本書](https://www.hello-algo.com/en/chapter_preface/suggestions/) -- [0.3   小結](https://www.hello-algo.com/en/chapter_preface/summary/) +- [0.1   關於本書](about_the_book.md) +- [0.2   如何使用本書](suggestions.md) +- [0.3   小結](summary.md) diff --git a/zh-Hant/docs/chapter_searching/index.md b/zh-Hant/docs/chapter_searching/index.md index b7f289ca3..ec8ae8cd6 100644 --- a/zh-Hant/docs/chapter_searching/index.md +++ b/zh-Hant/docs/chapter_searching/index.md @@ -13,11 +13,11 @@ icon: material/text-search 在這場尋覓之旅中，每一次探索都可能得到一個未曾料想的答案。 -## Chapter Contents +## 本章內容 -- [10.1   二分搜尋](https://www.hello-algo.com/en/chapter_searching/binary_search/) -- [10.2   二分搜尋插入點](https://www.hello-algo.com/en/chapter_searching/binary_search_insertion/) -- [10.3   二分搜尋邊界](https://www.hello-algo.com/en/chapter_searching/binary_search_edge/) -- [10.4   雜湊最佳化策略](https://www.hello-algo.com/en/chapter_searching/replace_linear_by_hashing/) -- [10.5   重識搜尋演算法](https://www.hello-algo.com/en/chapter_searching/searching_algorithm_revisited/) -- [10.6   小結](https://www.hello-algo.com/en/chapter_searching/summary/) +- [10.1   二分搜尋](binary_search.md) +- [10.2   二分搜尋插入點](binary_search_insertion.md) +- [10.3   二分搜尋邊界](binary_search_edge.md) +- [10.4   雜湊最佳化策略](replace_linear_by_hashing.md) +- [10.5   重識搜尋演算法](searching_algorithm_revisited.md) +- [10.6   小結](summary.md) diff --git a/zh-Hant/docs/chapter_sorting/index.md b/zh-Hant/docs/chapter_sorting/index.md index 6b3c735d5..1142a29ef 100644 --- a/zh-Hant/docs/chapter_sorting/index.md +++ b/zh-Hant/docs/chapter_sorting/index.md @@ -13,16 +13,16 @@ icon: material/sort-ascending 無論是簡單的升序，還是複雜的分類排列，排序都向我們展示了資料的和諧美感。 -## Chapter Contents +## 本章內容 -- [11.1   排序演算法](https://www.hello-algo.com/en/chapter_sorting/sorting_algorithm/) -- [11.2   選擇排序](https://www.hello-algo.com/en/chapter_sorting/selection_sort/) -- [11.3   泡沫排序](https://www.hello-algo.com/en/chapter_sorting/bubble_sort/) -- [11.4   插入排序](https://www.hello-algo.com/en/chapter_sorting/insertion_sort/) -- [11.5   快速排序](https://www.hello-algo.com/en/chapter_sorting/quick_sort/) -- [11.6   合併排序](https://www.hello-algo.com/en/chapter_sorting/merge_sort/) -- [11.7   堆積排序](https://www.hello-algo.com/en/chapter_sorting/heap_sort/) -- [11.8   桶排序](https://www.hello-algo.com/en/chapter_sorting/bucket_sort/) -- [11.9   計數排序](https://www.hello-algo.com/en/chapter_sorting/counting_sort/) -- [11.10   基數排序](https://www.hello-algo.com/en/chapter_sorting/radix_sort/) -- [11.11   小結](https://www.hello-algo.com/en/chapter_sorting/summary/) +- [11.1   排序演算法](sorting_algorithm.md) +- [11.2   選擇排序](selection_sort.md) +- [11.3   泡沫排序](bubble_sort.md) +- [11.4   插入排序](insertion_sort.md) +- [11.5   快速排序](quick_sort.md) +- [11.6   合併排序](merge_sort.md) +- [11.7   堆積排序](heap_sort.md) +- [11.8   桶排序](bucket_sort.md) +- [11.9   計數排序](counting_sort.md) +- [11.10   基數排序](radix_sort.md) +- [11.11   小結](summary.md) diff --git a/zh-Hant/docs/chapter_stack_and_queue/index.md b/zh-Hant/docs/chapter_stack_and_queue/index.md index 0bcbc0c19..9a6bfde74 100644 --- a/zh-Hant/docs/chapter_stack_and_queue/index.md +++ b/zh-Hant/docs/chapter_stack_and_queue/index.md @@ -13,9 +13,9 @@ icon: material/stack-overflow 兩者分別代表先入後出和先入先出的邏輯關係。 -## Chapter Contents +## 本章內容 -- [5.1   堆疊](https://www.hello-algo.com/en/chapter_stack_and_queue/stack/) -- [5.2   佇列](https://www.hello-algo.com/en/chapter_stack_and_queue/queue/) -- [5.3   雙向佇列](https://www.hello-algo.com/en/chapter_stack_and_queue/deque/) -- [5.4   小結](https://www.hello-algo.com/en/chapter_stack_and_queue/summary/) +- [5.1   堆疊](stack.md) +- [5.2   佇列](queue.md) +- [5.3   雙向佇列](deque.md) +- [5.4   小結](summary.md) diff --git a/zh-Hant/docs/chapter_tree/index.md b/zh-Hant/docs/chapter_tree/index.md index c23d03749..6be4456e6 100644 --- a/zh-Hant/docs/chapter_tree/index.md +++ b/zh-Hant/docs/chapter_tree/index.md @@ -13,11 +13,11 @@ icon: material/graph-outline 它為我們展現了資料分治的生動形態。 -## Chapter Contents +## 本章內容 -- [7.1   二元樹](https://www.hello-algo.com/en/chapter_tree/binary_tree/) -- [7.2   二元樹走訪](https://www.hello-algo.com/en/chapter_tree/binary_tree_traversal/) -- [7.3   二元樹陣列表示](https://www.hello-algo.com/en/chapter_tree/array_representation_of_tree/) -- [7.4   二元搜尋樹](https://www.hello-algo.com/en/chapter_tree/binary_search_tree/) -- [7.5   AVL *](https://www.hello-algo.com/en/chapter_tree/avl_tree/) -- [7.6   小結](https://www.hello-algo.com/en/chapter_tree/summary/) +- [7.1   二元樹](binary_tree.md) +- [7.2   二元樹走訪](binary_tree_traversal.md) +- [7.3   二元樹陣列表示](array_representation_of_tree.md) +- [7.4   二元搜尋樹](binary_search_tree.md) +- [7.5   AVL *](avl_tree.md) +- [7.6   小結](summary.md) diff --git a/zh-Hant/docs/index.html b/zh-Hant/docs/index.html index 47809e415..c4d11adc5 100644 --- a/zh-Hant/docs/index.html +++ b/zh-Hant/docs/index.html @@ -144,7 +144,7 @@
Cover
- 紙質書（簡體中文版） + 紙質書（簡中） @@ -170,7 +170,7 @@
- 下載 PDF + PDF（簡中）