From 7f43facfd9e4267b00ff26a676ccce3e5bd0419b Mon Sep 17 00:00:00 2001 From: krahets Date: Wed, 10 May 2023 20:59:33 +0800 Subject: [PATCH] build --- chapter_backtracking/backtracking_algorithm.md | 2 +- chapter_searching/replace_linear_by_hashing.md | 2 +- chapter_sorting/counting_sort.md | 2 +- chapter_tree/binary_search_tree.md | 4 ++-- chapter_tree/binary_tree_traversal.md | 2 +- 5 files changed, 6 insertions(+), 6 deletions(-) diff --git a/chapter_backtracking/backtracking_algorithm.md b/chapter_backtracking/backtracking_algorithm.md index 07710273a..76c47db51 100644 --- a/chapter_backtracking/backtracking_algorithm.md +++ b/chapter_backtracking/backtracking_algorithm.md @@ -275,7 +275,7 @@ comments: true 在每次“尝试”中，我们通过将当前节点添加进 `path` 来记录路径；而在“回退”前，我们需要将该节点从 `path` 中弹出，**以恢复本次尝试之前的状态**。换句话说，**我们可以将尝试和回退理解为“前进”与“撤销”**，两个操作是互为相反的。 === "<1>" - ![preorder_find_paths_step1](backtracking_algorithm.assets/preorder_find_paths_step1.png) + ![尝试与回退](backtracking_algorithm.assets/preorder_find_paths_step1.png) === "<2>" ![preorder_find_paths_step2](backtracking_algorithm.assets/preorder_find_paths_step2.png) diff --git a/chapter_searching/replace_linear_by_hashing.md b/chapter_searching/replace_linear_by_hashing.md index e97857a23..ab0d6b711 100755 --- a/chapter_searching/replace_linear_by_hashing.md +++ b/chapter_searching/replace_linear_by_hashing.md @@ -203,7 +203,7 @@ comments: true 2. 将键值对 `num[i]` 和索引 `i` 添加进哈希表； === "<1>" - ![two_sum_hashtable_step1](replace_linear_by_hashing.assets/two_sum_hashtable_step1.png) + ![辅助哈希表求解两数之和](replace_linear_by_hashing.assets/two_sum_hashtable_step1.png) === "<2>" ![two_sum_hashtable_step2](replace_linear_by_hashing.assets/two_sum_hashtable_step2.png) diff --git a/chapter_sorting/counting_sort.md b/chapter_sorting/counting_sort.md index b9accf8eb..131ace2c2 100644 --- a/chapter_sorting/counting_sort.md +++ b/chapter_sorting/counting_sort.md @@ -287,7 +287,7 @@ $$ 遍历完成后，数组 `res` 中就是排序好的结果，最后使用 `res` 覆盖原数组 `nums` 即可。 === "<1>" - ![counting_sort_step1](counting_sort.assets/counting_sort_step1.png) + ![计数排序步骤](counting_sort.assets/counting_sort_step1.png) === "<2>" ![counting_sort_step2](counting_sort.assets/counting_sort_step2.png) diff --git a/chapter_tree/binary_search_tree.md b/chapter_tree/binary_search_tree.md index 166e024ba..b072468ab 100755 --- a/chapter_tree/binary_search_tree.md +++ b/chapter_tree/binary_search_tree.md @@ -24,7 +24,7 @@ comments: true - 若 `cur.val = num` ，说明找到目标节点，跳出循环并返回该节点； === "<1>" - ![bst_search_step1](binary_search_tree.assets/bst_search_step1.png) + ![二叉搜索树查找节点示例](binary_search_tree.assets/bst_search_step1.png) === "<2>" ![bst_search_step2](binary_search_tree.assets/bst_search_step2.png) @@ -620,7 +620,7 @@ comments: true 3. 用 `tmp` 的值覆盖待删除节点的值； === "<1>" - ![bst_remove_case3_step1](binary_search_tree.assets/bst_remove_case3_step1.png) + ![二叉搜索树删除节点示例](binary_search_tree.assets/bst_remove_case3_step1.png) === "<2>" ![bst_remove_case3_step2](binary_search_tree.assets/bst_remove_case3_step2.png) diff --git a/chapter_tree/binary_tree_traversal.md b/chapter_tree/binary_tree_traversal.md index 59c2e5377..d5eac5670 100755 --- a/chapter_tree/binary_tree_traversal.md +++ b/chapter_tree/binary_tree_traversal.md @@ -651,7 +651,7 @@ comments: true 递归过程可分为“递”和“归”两个相反的部分。“递”表示开启新方法，程序在此过程中访问下一个节点；“归”表示函数返回，代表该节点已经访问完毕。如下图所示，为前序遍历二叉树的递归过程。 === "<1>" - ![preorder_step1](binary_tree_traversal.assets/preorder_step1.png) + ![前序遍历的递归过程](binary_tree_traversal.assets/preorder_step1.png) === "<2>" ![preorder_step2](binary_tree_traversal.assets/preorder_step2.png)