From b5dd5355fc5aba549b68f198d8a312eac0033302 Mon Sep 17 00:00:00 2001 From: krahets Date: Wed, 6 Dec 2023 22:28:53 +0800 Subject: [PATCH] deploy --- chapter_appendix/contribution/index.html | 43 +--- chapter_appendix/index.html | 43 +--- chapter_appendix/installation/index.html | 43 +--- chapter_appendix/terminology/index.html | 43 +--- chapter_array_and_linkedlist/array/index.html | 43 +--- chapter_array_and_linkedlist/index.html | 43 +--- .../linked_list/index.html | 43 +--- chapter_array_and_linkedlist/list/index.html | 43 +--- .../ram_and_cache/index.html | 43 +--- .../summary/index.html | 43 +--- .../backtracking_algorithm/index.html | 43 +--- chapter_backtracking/index.html | 43 +--- .../n_queens_problem/index.html | 43 +--- .../permutations_problem/index.html | 43 +--- .../subset_sum_problem/index.html | 43 +--- chapter_backtracking/summary/index.html | 43 +--- chapter_computational_complexity/index.html | 43 +--- .../iteration_and_recursion/index.html | 43 +--- .../performance_evaluation/index.html | 43 +--- .../space_complexity/index.html | 43 +--- .../summary/index.html | 43 +--- .../time_complexity/index.html | 43 +--- .../basic_data_types/index.html | 43 +--- .../character_encoding/index.html | 43 +--- .../index.html | 43 +--- chapter_data_structure/index.html | 43 +--- .../number_encoding/index.html | 43 +--- chapter_data_structure/summary/index.html | 43 +--- .../binary_search_recur/index.html | 43 +--- .../build_binary_tree_problem/index.html | 43 +--- .../divide_and_conquer/index.html | 43 +--- .../hanota_problem/index.html | 43 +--- chapter_divide_and_conquer/index.html | 43 +--- chapter_divide_and_conquer/summary/index.html | 43 +--- .../dp_problem_features/index.html | 43 +--- .../dp_solution_pipeline/index.html | 43 +--- .../edit_distance_problem/index.html | 43 +--- chapter_dynamic_programming/index.html | 43 +--- .../intro_to_dynamic_programming/index.html | 43 +--- .../knapsack_problem/index.html | 43 +--- .../summary/index.html | 43 +--- .../unbounded_knapsack_problem/index.html | 43 +--- chapter_graph/graph/index.html | 43 +--- chapter_graph/graph_operations/index.html | 43 +--- chapter_graph/graph_traversal/index.html | 43 +--- chapter_graph/index.html | 43 +--- chapter_graph/summary/index.html | 43 +--- .../fractional_knapsack_problem/index.html | 43 +--- chapter_greedy/greedy_algorithm/index.html | 43 +--- chapter_greedy/index.html | 43 +--- .../max_capacity_problem/index.html | 43 +--- .../max_product_cutting_problem/index.html | 43 +--- chapter_greedy/summary/index.html | 43 +--- chapter_hashing/hash_algorithm/index.html | 43 +--- chapter_hashing/hash_collision/index.html | 43 +--- chapter_hashing/hash_map/index.html | 43 +--- chapter_hashing/index.html | 43 +--- chapter_hashing/summary/index.html | 43 +--- chapter_heap/build_heap/index.html | 43 +--- chapter_heap/heap/index.html | 43 +--- chapter_heap/index.html | 43 +--- chapter_heap/summary/index.html | 43 +--- chapter_heap/top_k/index.html | 43 +--- .../algorithms_are_everywhere/index.html | 43 +--- chapter_introduction/index.html | 43 +--- chapter_introduction/summary/index.html | 43 +--- chapter_introduction/what_is_dsa/index.html | 43 +--- chapter_preface/about_the_book/index.html | 43 +--- chapter_preface/index.html | 43 +--- chapter_preface/suggestions/index.html | 43 +--- chapter_preface/summary/index.html | 43 +--- chapter_reference/index.html | 43 +--- chapter_searching/binary_search/index.html | 43 +--- .../binary_search_edge/index.html | 43 +--- .../binary_search_insertion/index.html | 43 +--- chapter_searching/index.html | 43 +--- .../replace_linear_by_hashing/index.html | 43 +--- .../searching_algorithm_revisited/index.html | 43 +--- chapter_searching/summary/index.html | 43 +--- chapter_sorting/bubble_sort/index.html | 43 +--- chapter_sorting/bucket_sort/index.html | 43 +--- chapter_sorting/counting_sort/index.html | 43 +--- chapter_sorting/heap_sort/index.html | 43 +--- chapter_sorting/index.html | 43 +--- chapter_sorting/insertion_sort/index.html | 43 +--- chapter_sorting/merge_sort/index.html | 43 +--- chapter_sorting/quick_sort/index.html | 43 +--- chapter_sorting/radix_sort/index.html | 43 +--- chapter_sorting/selection_sort/index.html | 43 +--- chapter_sorting/sorting_algorithm/index.html | 43 +--- chapter_sorting/summary/index.html | 43 +--- chapter_stack_and_queue/deque/index.html | 43 +--- chapter_stack_and_queue/index.html | 43 +--- chapter_stack_and_queue/queue/index.html | 43 +--- chapter_stack_and_queue/stack/index.html | 43 +--- chapter_stack_and_queue/summary/index.html | 43 +--- .../array_representation_of_tree/index.html | 43 +--- chapter_tree/avl_tree/index.html | 43 +--- chapter_tree/binary_search_tree/index.html | 43 +--- chapter_tree/binary_tree/index.html | 43 +--- chapter_tree/binary_tree_traversal/index.html | 43 +--- chapter_tree/index.html | 43 +--- chapter_tree/summary/index.html | 43 +--- index.html | 56 ++--- partials/LICENSE | 19 ++ search/search_index.json | 2 +- sitemap.xml | 208 +++++++++--------- sitemap.xml.gz | Bin 999 -> 999 bytes stylesheets/extra.css | 29 ++- 109 files changed, 1387 insertions(+), 3356 deletions(-) create mode 100644 partials/LICENSE diff --git a/chapter_appendix/contribution/index.html b/chapter_appendix/contribution/index.html index c3ce110ba..007b9d0ba 100644 --- a/chapter_appendix/contribution/index.html +++ b/chapter_appendix/contribution/index.html @@ -3352,48 +3352,29 @@
- - - + + + + - + - + + + - - -

16.2   一起参与创作

由于笔者能力有限，书中难免存在一些遗漏和错误，请您谅解。如果您发现了笔误、链接失效、内容缺失、文字歧义、解释不清晰或行文结构不合理等问题，请协助我们进行修正，以给读者提供更优质的学习资源。

diff --git a/chapter_appendix/index.html b/chapter_appendix/index.html index 419b4594d..be322e9de 100644 --- a/chapter_appendix/index.html +++ b/chapter_appendix/index.html @@ -3277,48 +3277,29 @@
- - - + + + + - + - + + + - - -

第 16 章   附录

diff --git a/chapter_appendix/installation/index.html b/chapter_appendix/installation/index.html index 95da17608..49cb9f6b9 100644 --- a/chapter_appendix/installation/index.html +++ b/chapter_appendix/installation/index.html @@ -3476,48 +3476,29 @@
- - - + + + + - + - + + + - - -

16.1   编程环境安装

16.1.1   安装 IDE

diff --git a/chapter_appendix/terminology/index.html b/chapter_appendix/terminology/index.html index 8c4db61a1..52babd394 100644 --- a/chapter_appendix/terminology/index.html +++ b/chapter_appendix/terminology/index.html @@ -3272,48 +3272,29 @@
- - - + + + + - + - + + + - - -

16.3   术语表

表 16-1 列出了书中出现的重要术语。建议你同时记住它们的中英文叫法，以便阅读英文文献。

diff --git a/chapter_array_and_linkedlist/array/index.html b/chapter_array_and_linkedlist/array/index.html index b883032f3..212512ed2 100644 --- a/chapter_array_and_linkedlist/array/index.html +++ b/chapter_array_and_linkedlist/array/index.html @@ -3462,48 +3462,29 @@
- - - + + + + - + - + + + - - -

4.1   数组

「数组 array」是一种线性数据结构，其将相同类型的元素存储在连续的内存空间中。我们将元素在数组中的位置称为该元素的「索引 index」。图 4-1 展示了数组的主要术语和概念。

diff --git a/chapter_array_and_linkedlist/index.html b/chapter_array_and_linkedlist/index.html index 00e67985e..7bd1c6514 100644 --- a/chapter_array_and_linkedlist/index.html +++ b/chapter_array_and_linkedlist/index.html @@ -3277,48 +3277,29 @@
- - - + + + + - + - + + + - - -

第 4 章   数组与链表

数组与链表

diff --git a/chapter_array_and_linkedlist/linked_list/index.html b/chapter_array_and_linkedlist/linked_list/index.html index 2a2a3223c..6970c0db0 100644 --- a/chapter_array_and_linkedlist/linked_list/index.html +++ b/chapter_array_and_linkedlist/linked_list/index.html @@ -3448,48 +3448,29 @@
- - - + + + + - + - + + + - - -

4.2   链表

内存空间是所有程序的公共资源，在一个复杂的系统运行环境下，空闲的内存空间可能散落在内存各处。我们知道，存储数组的内存空间必须是连续的，而当数组非常大时，内存可能无法提供如此大的连续空间。此时链表的灵活性优势就体现出来了。

diff --git a/chapter_array_and_linkedlist/list/index.html b/chapter_array_and_linkedlist/list/index.html index c6f8af252..85f6d28db 100644 --- a/chapter_array_and_linkedlist/list/index.html +++ b/chapter_array_and_linkedlist/list/index.html @@ -3434,48 +3434,29 @@
- - - + + + + - + - + + + - - -

4.3   列表

「列表 list」是一个抽象的数据结构概念，它表示元素的有序集合，支持元素访问、修改、添加、删除和遍历等操作，无须使用者考虑容量限制的问题。列表可以基于链表或数组实现。

diff --git a/chapter_array_and_linkedlist/ram_and_cache/index.html b/chapter_array_and_linkedlist/ram_and_cache/index.html index 5cb73b9db..b51eb63a6 100644 --- a/chapter_array_and_linkedlist/ram_and_cache/index.html +++ b/chapter_array_and_linkedlist/ram_and_cache/index.html @@ -3360,48 +3360,29 @@
- - - + + + + - + - + + + - - -

4.4   内存与缓存 *

在本章的前两节中，我们探讨了数组和链表这两种基础且重要的数据结构，它们分别代表了“连续存储”和“分散存储”这两种不同的物理结构。

diff --git a/chapter_array_and_linkedlist/summary/index.html b/chapter_array_and_linkedlist/summary/index.html index dc5d779ee..d0bba6df0 100644 --- a/chapter_array_and_linkedlist/summary/index.html +++ b/chapter_array_and_linkedlist/summary/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

4.5   小结

1.   重点回顾

diff --git a/chapter_backtracking/backtracking_algorithm/index.html b/chapter_backtracking/backtracking_algorithm/index.html index 0f73b7dd6..1769e114a 100644 --- a/chapter_backtracking/backtracking_algorithm/index.html +++ b/chapter_backtracking/backtracking_algorithm/index.html @@ -3394,48 +3394,29 @@
- - - + + + + - + - + + + - - -

13.1   回溯算法

「回溯算法 backtracking algorithm」是一种通过穷举来解决问题的方法，它的核心思想是从一个初始状态出发，暴力搜索所有可能的解决方案，当遇到正确的解则将其记录，直到找到解或者尝试了所有可能的选择都无法找到解为止。

diff --git a/chapter_backtracking/index.html b/chapter_backtracking/index.html index f5d9b4ab2..7c8c5d2fe 100644 --- a/chapter_backtracking/index.html +++ b/chapter_backtracking/index.html @@ -3277,48 +3277,29 @@
- - - + + + + - + - + + + - - -

第 13 章   回溯

diff --git a/chapter_backtracking/n_queens_problem/index.html b/chapter_backtracking/n_queens_problem/index.html index a70a9179e..1b072940d 100644 --- a/chapter_backtracking/n_queens_problem/index.html +++ b/chapter_backtracking/n_queens_problem/index.html @@ -3352,48 +3352,29 @@
- - - + + + + - + - + + + - - -

13.4   N 皇后问题

diff --git a/chapter_backtracking/permutations_problem/index.html b/chapter_backtracking/permutations_problem/index.html index f536fbe26..b8ee0ce4d 100644 --- a/chapter_backtracking/permutations_problem/index.html +++ b/chapter_backtracking/permutations_problem/index.html @@ -3432,48 +3432,29 @@
- - - + + + + - + - + + + - - -

13.2   全排列问题

全排列问题是回溯算法的一个典型应用。它的定义是在给定一个集合（如一个数组或字符串）的情况下，找出其中元素的所有可能的排列。

diff --git a/chapter_backtracking/subset_sum_problem/index.html b/chapter_backtracking/subset_sum_problem/index.html index 8d2d2d255..3d4ad5f0c 100644 --- a/chapter_backtracking/subset_sum_problem/index.html +++ b/chapter_backtracking/subset_sum_problem/index.html @@ -3432,48 +3432,29 @@
- - - + + + + - + - + + + - - -

13.3   子集和问题

13.3.1   无重复元素的情况

diff --git a/chapter_backtracking/summary/index.html b/chapter_backtracking/summary/index.html index 5ac1ad3fa..ee6c43e37 100644 --- a/chapter_backtracking/summary/index.html +++ b/chapter_backtracking/summary/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

13.5   小结

1.   重点回顾

diff --git a/chapter_computational_complexity/index.html b/chapter_computational_complexity/index.html index e68c6601e..5f0c40d9b 100644 --- a/chapter_computational_complexity/index.html +++ b/chapter_computational_complexity/index.html @@ -3277,48 +3277,29 @@
- - - + + + + - + - + + + - - -

第 2 章   复杂度分析

diff --git a/chapter_computational_complexity/iteration_and_recursion/index.html b/chapter_computational_complexity/iteration_and_recursion/index.html index a4806194f..c3bc1298b 100644 --- a/chapter_computational_complexity/iteration_and_recursion/index.html +++ b/chapter_computational_complexity/iteration_and_recursion/index.html @@ -3460,48 +3460,29 @@
- - - + + + + - + - + + + - - -

2.2   迭代与递归

在算法中，重复执行某个任务是很常见的，其与复杂度分析息息相关。因此，在展开介绍时间复杂度和空间复杂度之前，我们先来了解如何在程序中实现重复执行任务，即两种基本的程序控制结构：迭代、递归。

diff --git a/chapter_computational_complexity/performance_evaluation/index.html b/chapter_computational_complexity/performance_evaluation/index.html index 65f605902..a19958235 100644 --- a/chapter_computational_complexity/performance_evaluation/index.html +++ b/chapter_computational_complexity/performance_evaluation/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

2.1   算法效率评估

在算法设计中，我们先后追求以下两个层面的目标。

diff --git a/chapter_computational_complexity/space_complexity/index.html b/chapter_computational_complexity/space_complexity/index.html index c56d1d3a7..4ab9025e1 100644 --- a/chapter_computational_complexity/space_complexity/index.html +++ b/chapter_computational_complexity/space_complexity/index.html @@ -3448,48 +3448,29 @@
- - - + + + + - + - + + + - - -

2.4   空间复杂度

「空间复杂度 space complexity」用于衡量算法占用内存空间随着数据量变大时的增长趋势。这个概念与时间复杂度非常类似，只需将“运行时间”替换为“占用内存空间”。

diff --git a/chapter_computational_complexity/summary/index.html b/chapter_computational_complexity/summary/index.html index 7c3b900c0..727b305a3 100644 --- a/chapter_computational_complexity/summary/index.html +++ b/chapter_computational_complexity/summary/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

2.5   小结

1.   重点回顾

diff --git a/chapter_computational_complexity/time_complexity/index.html b/chapter_computational_complexity/time_complexity/index.html index 81a09f813..bd07dee40 100644 --- a/chapter_computational_complexity/time_complexity/index.html +++ b/chapter_computational_complexity/time_complexity/index.html @@ -3530,48 +3530,29 @@
- - - + + + + - + - + + + - - -

2.3   时间复杂度

运行时间可以直观且准确地反映算法的效率。如果我们想准确预估一段代码的运行时间，应该如何操作呢？

diff --git a/chapter_data_structure/basic_data_types/index.html b/chapter_data_structure/basic_data_types/index.html index 8122c9995..54c05d4df 100644 --- a/chapter_data_structure/basic_data_types/index.html +++ b/chapter_data_structure/basic_data_types/index.html @@ -3272,48 +3272,29 @@
- - - + + + + - + - + + + - - -

3.2   基本数据类型

当谈及计算机中的数据时，我们会想到文本、图片、视频、语音、3D 模型等各种形式。尽管这些数据的组织形式各异，但它们都由各种基本数据类型构成。

diff --git a/chapter_data_structure/character_encoding/index.html b/chapter_data_structure/character_encoding/index.html index 6fa5f82d5..d2cf20c08 100644 --- a/chapter_data_structure/character_encoding/index.html +++ b/chapter_data_structure/character_encoding/index.html @@ -3380,48 +3380,29 @@
- - - + + + + - + - + + + - - -

3.4   字符编码 *

在计算机中，所有数据都是以二进制数的形式存储的，字符 char 也不例外。为了表示字符，我们需要建立一套“字符集”，规定每个字符和二进制数之间的一一对应关系。有了字符集之后，计算机就可以通过查表完成二进制数到字符的转换。

diff --git a/chapter_data_structure/classification_of_data_structure/index.html b/chapter_data_structure/classification_of_data_structure/index.html index 5c18bc805..176888d8f 100644 --- a/chapter_data_structure/classification_of_data_structure/index.html +++ b/chapter_data_structure/classification_of_data_structure/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

3.1   数据结构分类

常见的数据结构包括数组、链表、栈、队列、哈希表、树、堆、图，它们可以从“逻辑结构”和“物理结构”两个维度进行分类。

diff --git a/chapter_data_structure/index.html b/chapter_data_structure/index.html index 4c5ea88b8..1947aa645 100644 --- a/chapter_data_structure/index.html +++ b/chapter_data_structure/index.html @@ -3277,48 +3277,29 @@
- - - + + + + - + - + + + - - -

第 3 章   数据结构

diff --git a/chapter_data_structure/number_encoding/index.html b/chapter_data_structure/number_encoding/index.html index 6e6498735..9569b6be1 100644 --- a/chapter_data_structure/number_encoding/index.html +++ b/chapter_data_structure/number_encoding/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

3.3   数字编码 *

diff --git a/chapter_data_structure/summary/index.html b/chapter_data_structure/summary/index.html index a3a52940c..4a536207f 100644 --- a/chapter_data_structure/summary/index.html +++ b/chapter_data_structure/summary/index.html @@ -3338,48 +3338,29 @@
- - - + + + + - + - + + + - - -

3.5   小结

1.   重点回顾

diff --git a/chapter_divide_and_conquer/binary_search_recur/index.html b/chapter_divide_and_conquer/binary_search_recur/index.html index fb6e90313..cd1f5e08a 100644 --- a/chapter_divide_and_conquer/binary_search_recur/index.html +++ b/chapter_divide_and_conquer/binary_search_recur/index.html @@ -3324,48 +3324,29 @@
- - - + + + + - + - + + + - - -

12.2   分治搜索策略

我们已经学过，搜索算法分为两大类。

diff --git a/chapter_divide_and_conquer/build_binary_tree_problem/index.html b/chapter_divide_and_conquer/build_binary_tree_problem/index.html index d76afa9f0..7dd4ad897 100644 --- a/chapter_divide_and_conquer/build_binary_tree_problem/index.html +++ b/chapter_divide_and_conquer/build_binary_tree_problem/index.html @@ -3366,48 +3366,29 @@
- - - + + + + - + - + + + - - -

12.3   构建二叉树问题

diff --git a/chapter_divide_and_conquer/divide_and_conquer/index.html b/chapter_divide_and_conquer/divide_and_conquer/index.html index 1c83fb4cc..46bef3a35 100644 --- a/chapter_divide_and_conquer/divide_and_conquer/index.html +++ b/chapter_divide_and_conquer/divide_and_conquer/index.html @@ -3392,48 +3392,29 @@
- - - + + + + - + - + + + - - -

12.1   分治算法

「分治 divide and conquer」，全称分而治之，是一种非常重要且常见的算法策略。分治通常基于递归实现，包括“分”和“治”两个步骤。

diff --git a/chapter_divide_and_conquer/hanota_problem/index.html b/chapter_divide_and_conquer/hanota_problem/index.html index f17e1b592..b1869c1e6 100644 --- a/chapter_divide_and_conquer/hanota_problem/index.html +++ b/chapter_divide_and_conquer/hanota_problem/index.html @@ -3352,48 +3352,29 @@
- - - + + + + - + - + + + - - -

12.4   汉诺塔问题

在归并排序和构建二叉树中，我们都是将原问题分解为两个规模为原问题一半的子问题。然而对于汉诺塔问题，我们采用不同的分解策略。

diff --git a/chapter_divide_and_conquer/index.html b/chapter_divide_and_conquer/index.html index aafa09a06..246aac4fc 100644 --- a/chapter_divide_and_conquer/index.html +++ b/chapter_divide_and_conquer/index.html @@ -3277,48 +3277,29 @@
- - - + + + + - + - + + + - - -

第 12 章   分治

diff --git a/chapter_divide_and_conquer/summary/index.html b/chapter_divide_and_conquer/summary/index.html index 09e744614..2054113de 100644 --- a/chapter_divide_and_conquer/summary/index.html +++ b/chapter_divide_and_conquer/summary/index.html @@ -3272,48 +3272,29 @@
- - - + + + + - + - + + + - - -

12.5   小结