Prepare 1.0.0b3 release.

2024-12-24 09:56:29 +08:00 · 2023-05-10 21:00:04 +08:00 · 2023-05-10 21:00:04 +08:00 · 7ca27c3df1
commit 7ca27c3df1
parent def8da6617
30 changed files with 6 additions and 6 deletions
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step1.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step1.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step10.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step10.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step11.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step11.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step2.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step2.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step3.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step3.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step4.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step4.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step5.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step5.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step6.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step6.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step7.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step7.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step8.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step8.png
--- a/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step9.png
+++ b/docs/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step9.png
--- a/docs/chapter_backtracking/backtracking_algorithm.md
+++ b/docs/chapter_backtracking/backtracking_algorithm.md
@ -145,7 +145,7 @@
 在每次“尝试”中，我们通过将当前节点添加进 `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)
--- a/docs/chapter_backtracking/permutations_problem.assets/permutations_ii.png
+++ b/docs/chapter_backtracking/permutations_problem.assets/permutations_ii.png
--- a/docs/chapter_searching/replace_linear_by_hashing.assets/hashing_search.png
+++ b/docs/chapter_searching/replace_linear_by_hashing.assets/hashing_search.png
--- a/docs/chapter_searching/replace_linear_by_hashing.assets/linear_search.png
+++ b/docs/chapter_searching/replace_linear_by_hashing.assets/linear_search.png
--- a/docs/chapter_searching/replace_linear_by_hashing.md
+++ b/docs/chapter_searching/replace_linear_by_hashing.md
@ -82,7 +82,7 @@
 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)
--- a/docs/chapter_sorting/counting_sort.md
+++ b/docs/chapter_sorting/counting_sort.md
@ -94,7 +94,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)
--- a/docs/chapter_tree/binary_search_tree.md
+++ b/docs/chapter_tree/binary_search_tree.md
@ -18,7 +18,7 @@
 - 若 `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)
@ -185,7 +185,7 @@
 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)
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step1.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step1.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step10.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step10.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step11.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step11.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step2.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step2.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step3.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step3.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step4.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step4.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step5.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step5.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step6.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step6.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step7.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step7.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step8.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step8.png
--- a/docs/chapter_tree/binary_tree_traversal.assets/preorder_step9.png
+++ b/docs/chapter_tree/binary_tree_traversal.assets/preorder_step9.png
--- a/docs/chapter_tree/binary_tree_traversal.md
+++ b/docs/chapter_tree/binary_tree_traversal.md
@ -209,7 +209,7 @@
 递归过程可分为“递”和“归”两个相反的部分。“递”表示开启新方法，程序在此过程中访问下一个节点；“归”表示函数返回，代表该节点已经访问完毕。如下图所示，为前序遍历二叉树的递归过程。

 === "<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)