deploy

2024-12-25 02:06:28 +08:00 · 2023-10-27 20:42:14 +08:00 · 2023-10-27 20:42:14 +08:00 · 06caf21467
commit 06caf21467
parent 893e649300
490 changed files with 153 additions and 152 deletions
--- a/chapter_appendix/contribution.assets/edit_markdown.png
+++ b/chapter_appendix/contribution.assets/edit_markdown.png
--- a/chapter_array_and_linkedlist/array.assets/array_definition.png
+++ b/chapter_array_and_linkedlist/array.assets/array_definition.png
--- a/chapter_array_and_linkedlist/array.assets/array_insert_element.png
+++ b/chapter_array_and_linkedlist/array.assets/array_insert_element.png
--- a/chapter_array_and_linkedlist/array.assets/array_memory_location_calculation.png
+++ b/chapter_array_and_linkedlist/array.assets/array_memory_location_calculation.png
--- a/chapter_array_and_linkedlist/array.assets/array_remove_element.png
+++ b/chapter_array_and_linkedlist/array.assets/array_remove_element.png
--- a/chapter_array_and_linkedlist/linked_list.assets/linkedlist_common_types.png
+++ b/chapter_array_and_linkedlist/linked_list.assets/linkedlist_common_types.png
--- a/chapter_array_and_linkedlist/linked_list.assets/linkedlist_definition.png
+++ b/chapter_array_and_linkedlist/linked_list.assets/linkedlist_definition.png
--- a/chapter_array_and_linkedlist/linked_list.assets/linkedlist_insert_node.png
+++ b/chapter_array_and_linkedlist/linked_list.assets/linkedlist_insert_node.png
--- a/chapter_array_and_linkedlist/linked_list.assets/linkedlist_remove_node.png
+++ b/chapter_array_and_linkedlist/linked_list.assets/linkedlist_remove_node.png
--- a/chapter_array_and_linkedlist/list/index.html
+++ b/chapter_array_and_linkedlist/list/index.html
@ -3442,9 +3442,9 @@
 <div class="tabbed-block">
 <div class="highlight"><span class="filename">list.py</span><pre><span></span><code><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a><span class="c1"># 初始化列表</span>
 <a id="__codelineno-0-2" name="__codelineno-0-2" href="#__codelineno-0-2"></a><span class="c1"># 无初始值</span>
-<a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="n">nums1</span><span class="p">:</span> <span class="n">nums</span><span class="p">[</span><span class="nb">int</span><span class="p">]</span> <span class="o">=</span> <span class="p">[]</span>
+<a id="__codelineno-0-3" name="__codelineno-0-3" href="#__codelineno-0-3"></a><span class="n">nums1</span><span class="p">:</span> <span class="nb">list</span><span class="p">[</span><span class="nb">int</span><span class="p">]</span> <span class="o">=</span> <span class="p">[]</span>
 <a id="__codelineno-0-4" name="__codelineno-0-4" href="#__codelineno-0-4"></a><span class="c1"># 有初始值</span>
-<a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="n">nums</span><span class="p">:</span> <span class="n">nums</span><span class="p">[</span><span class="nb">int</span><span class="p">]</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">4</span><span class="p">]</span>
+<a id="__codelineno-0-5" name="__codelineno-0-5" href="#__codelineno-0-5"></a><span class="n">nums</span><span class="p">:</span> <span class="nb">list</span><span class="p">[</span><span class="nb">int</span><span class="p">]</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">4</span><span class="p">]</span>
 </code></pre></div>
 </div>
 <div class="tabbed-block">
@ -4009,7 +4009,7 @@
 <div class="tabbed-content">
 <div class="tabbed-block">
 <div class="highlight"><span class="filename">list.py</span><pre><span></span><code><a id="__codelineno-48-1" name="__codelineno-48-1" href="#__codelineno-48-1"></a><span class="c1"># 拼接两个列表</span>
-<a id="__codelineno-48-2" name="__codelineno-48-2" href="#__codelineno-48-2"></a><span class="n">nums1</span><span class="p">:</span> <span class="n">nums</span><span class="p">[</span><span class="nb">int</span><span class="p">]</span> <span class="o">=</span> <span class="p">[</span><span class="mi">6</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">10</span><span class="p">,</span> <span class="mi">9</span><span class="p">]</span>
+<a id="__codelineno-48-2" name="__codelineno-48-2" href="#__codelineno-48-2"></a><span class="n">nums1</span><span class="p">:</span> <span class="nb">list</span><span class="p">[</span><span class="nb">int</span><span class="p">]</span> <span class="o">=</span> <span class="p">[</span><span class="mi">6</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">10</span><span class="p">,</span> <span class="mi">9</span><span class="p">]</span>
 <a id="__codelineno-48-3" name="__codelineno-48-3" href="#__codelineno-48-3"></a><span class="n">nums</span> <span class="o">+=</span> <span class="n">nums1</span>  <span class="c1"># 将列表 nums1 拼接到 nums 之后</span>
 </code></pre></div>
 </div>
--- a/chapter_backtracking/backtracking_algorithm.assets/backtrack_remove_return_or_not.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/backtrack_remove_return_or_not.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_constrained_paths.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_constrained_paths.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_nodes.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_nodes.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step1.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step1.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step10.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step10.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step11.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step11.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step2.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step2.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step3.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step3.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step4.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step4.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step5.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step5.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step6.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step6.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step7.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step7.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step8.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step8.png
--- a/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step9.png
+++ b/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step9.png
--- a/chapter_backtracking/n_queens_problem.assets/n_queens_cols_diagonals.png
+++ b/chapter_backtracking/n_queens_problem.assets/n_queens_cols_diagonals.png
--- a/chapter_backtracking/n_queens_problem.assets/n_queens_constraints.png
+++ b/chapter_backtracking/n_queens_problem.assets/n_queens_constraints.png
--- a/chapter_backtracking/n_queens_problem.assets/n_queens_placing.png
+++ b/chapter_backtracking/n_queens_problem.assets/n_queens_placing.png
--- a/chapter_backtracking/n_queens_problem.assets/solution_4_queens.png
+++ b/chapter_backtracking/n_queens_problem.assets/solution_4_queens.png
--- a/chapter_backtracking/n_queens_problem/index.html
+++ b/chapter_backtracking/n_queens_problem/index.html
@ -3904,8 +3904,8 @@
 </div>
 <div class="tabbed-block">
 <div class="highlight"><span class="filename">n_queens.c</span><pre><span></span><code><a id="__codelineno-10-1" name="__codelineno-10-1" href="#__codelineno-10-1"></a><span class="cm">/* 回溯算法：N 皇后 */</span>
-<a id="__codelineno-10-2" name="__codelineno-10-2" href="#__codelineno-10-2"></a><span class="kt">void</span><span class="w"> </span><span class="nf">backtrack</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">row</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="kt">char</span><span class="w"> </span><span class="n">state</span><span class="p">[</span><span class="n">MAX_N</span><span class="p">][</span><span class="n">MAX_N</span><span class="p">],</span><span class="w"> </span><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="n">res</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">resSize</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="w"> </span><span class="n">cols</span><span class="p">[</span><span class="n">MAX_N</span><span class="p">],</span>
-<a id="__codelineno-10-3" name="__codelineno-10-3" href="#__codelineno-10-3"></a><span class="w">               </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags1</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_N</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">],</span><span class="w"> </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags2</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_N</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">])</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-10-2" name="__codelineno-10-2" href="#__codelineno-10-2"></a><span class="kt">void</span><span class="w"> </span><span class="nf">backtrack</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">row</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="kt">char</span><span class="w"> </span><span class="n">state</span><span class="p">[</span><span class="n">MAX_SIZE</span><span class="p">][</span><span class="n">MAX_SIZE</span><span class="p">],</span><span class="w"> </span><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="n">res</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">resSize</span><span class="p">,</span><span class="w"> </span><span class="kt">bool</span><span class="w"> </span><span class="n">cols</span><span class="p">[</span><span class="n">MAX_SIZE</span><span class="p">],</span>
+<a id="__codelineno-10-3" name="__codelineno-10-3" href="#__codelineno-10-3"></a><span class="w">               </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags1</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_SIZE</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">],</span><span class="w"> </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags2</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_SIZE</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">])</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-10-4" name="__codelineno-10-4" href="#__codelineno-10-4"></a><span class="w">    </span><span class="c1">// 当放置完所有行时，记录解</span>
 <a id="__codelineno-10-5" name="__codelineno-10-5" href="#__codelineno-10-5"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">row</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-10-6" name="__codelineno-10-6" href="#__codelineno-10-6"></a><span class="w">        </span><span class="n">res</span><span class="p">[</span><span class="o">*</span><span class="n">resSize</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">char</span><span class="w"> </span><span class="o">**</span><span class="p">)</span><span class="n">malloc</span><span class="p">(</span><span class="k">sizeof</span><span class="p">(</span><span class="kt">char</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">n</span><span class="p">);</span>
@ -3937,7 +3937,7 @@
 <a id="__codelineno-10-32" name="__codelineno-10-32" href="#__codelineno-10-32"></a>
 <a id="__codelineno-10-33" name="__codelineno-10-33" href="#__codelineno-10-33"></a><span class="cm">/* 求解 N 皇后 */</span>
 <a id="__codelineno-10-34" name="__codelineno-10-34" href="#__codelineno-10-34"></a><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="nf">nQueens</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">returnSize</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-10-35" name="__codelineno-10-35" href="#__codelineno-10-35"></a><span class="w">    </span><span class="kt">char</span><span class="w"> </span><span class="n">state</span><span class="p">[</span><span class="n">MAX_N</span><span class="p">][</span><span class="n">MAX_N</span><span class="p">];</span>
+<a id="__codelineno-10-35" name="__codelineno-10-35" href="#__codelineno-10-35"></a><span class="w">    </span><span class="kt">char</span><span class="w"> </span><span class="n">state</span><span class="p">[</span><span class="n">MAX_SIZE</span><span class="p">][</span><span class="n">MAX_SIZE</span><span class="p">];</span>
 <a id="__codelineno-10-36" name="__codelineno-10-36" href="#__codelineno-10-36"></a><span class="w">    </span><span class="c1">// 初始化 n*n 大小的棋盘，其中 &#39;Q&#39; 代表皇后，&#39;#&#39; 代表空位</span>
 <a id="__codelineno-10-37" name="__codelineno-10-37" href="#__codelineno-10-37"></a><span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">n</span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-10-38" name="__codelineno-10-38" href="#__codelineno-10-38"></a><span class="w">        </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">j</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">j</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">n</span><span class="p">;</span><span class="w"> </span><span class="o">++</span><span class="n">j</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
@ -3945,11 +3945,11 @@
 <a id="__codelineno-10-40" name="__codelineno-10-40" href="#__codelineno-10-40"></a><span class="w">        </span><span class="p">}</span>
 <a id="__codelineno-10-41" name="__codelineno-10-41" href="#__codelineno-10-41"></a><span class="w">        </span><span class="n">state</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="n">n</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="sc">&#39;\0&#39;</span><span class="p">;</span>
 <a id="__codelineno-10-42" name="__codelineno-10-42" href="#__codelineno-10-42"></a><span class="w">    </span><span class="p">}</span>
-<a id="__codelineno-10-43" name="__codelineno-10-43" href="#__codelineno-10-43"></a><span class="w">    </span><span class="kt">bool</span><span class="w"> </span><span class="n">cols</span><span class="p">[</span><span class="n">MAX_N</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="nb">false</span><span class="p">};</span><span class="w">           </span><span class="c1">// 记录列是否有皇后</span>
-<a id="__codelineno-10-44" name="__codelineno-10-44" href="#__codelineno-10-44"></a><span class="w">    </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags1</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_N</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="nb">false</span><span class="p">};</span><span class="w"> </span><span class="c1">// 记录主对角线是否有皇后</span>
-<a id="__codelineno-10-45" name="__codelineno-10-45" href="#__codelineno-10-45"></a><span class="w">    </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags2</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_N</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="nb">false</span><span class="p">};</span><span class="w"> </span><span class="c1">// 记录副对角线是否有皇后</span>
+<a id="__codelineno-10-43" name="__codelineno-10-43" href="#__codelineno-10-43"></a><span class="w">    </span><span class="kt">bool</span><span class="w"> </span><span class="n">cols</span><span class="p">[</span><span class="n">MAX_SIZE</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="nb">false</span><span class="p">};</span><span class="w">           </span><span class="c1">// 记录列是否有皇后</span>
+<a id="__codelineno-10-44" name="__codelineno-10-44" href="#__codelineno-10-44"></a><span class="w">    </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags1</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_SIZE</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="nb">false</span><span class="p">};</span><span class="w"> </span><span class="c1">// 记录主对角线是否有皇后</span>
+<a id="__codelineno-10-45" name="__codelineno-10-45" href="#__codelineno-10-45"></a><span class="w">    </span><span class="kt">bool</span><span class="w"> </span><span class="n">diags2</span><span class="p">[</span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_SIZE</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="nb">false</span><span class="p">};</span><span class="w"> </span><span class="c1">// 记录副对角线是否有皇后</span>
 <a id="__codelineno-10-46" name="__codelineno-10-46" href="#__codelineno-10-46"></a>
-<a id="__codelineno-10-47" name="__codelineno-10-47" href="#__codelineno-10-47"></a><span class="w">    </span><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="p">)</span><span class="n">malloc</span><span class="p">(</span><span class="k">sizeof</span><span class="p">(</span><span class="kt">char</span><span class="w"> </span><span class="o">**</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_RES</span><span class="p">);</span>
+<a id="__codelineno-10-47" name="__codelineno-10-47" href="#__codelineno-10-47"></a><span class="w">    </span><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">char</span><span class="w"> </span><span class="o">***</span><span class="p">)</span><span class="n">malloc</span><span class="p">(</span><span class="k">sizeof</span><span class="p">(</span><span class="kt">char</span><span class="w"> </span><span class="o">**</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_SIZE</span><span class="p">);</span>
 <a id="__codelineno-10-48" name="__codelineno-10-48" href="#__codelineno-10-48"></a><span class="w">    </span><span class="o">*</span><span class="n">returnSize</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span>
 <a id="__codelineno-10-49" name="__codelineno-10-49" href="#__codelineno-10-49"></a><span class="w">    </span><span class="n">backtrack</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">state</span><span class="p">,</span><span class="w"> </span><span class="n">res</span><span class="p">,</span><span class="w"> </span><span class="n">returnSize</span><span class="p">,</span><span class="w"> </span><span class="n">cols</span><span class="p">,</span><span class="w"> </span><span class="n">diags1</span><span class="p">,</span><span class="w"> </span><span class="n">diags2</span><span class="p">);</span>
 <a id="__codelineno-10-50" name="__codelineno-10-50" href="#__codelineno-10-50"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="n">res</span><span class="p">;</span>
--- a/chapter_backtracking/permutations_problem.assets/permutations_i.png
+++ b/chapter_backtracking/permutations_problem.assets/permutations_i.png
--- a/chapter_backtracking/permutations_problem.assets/permutations_i_pruning.png
+++ b/chapter_backtracking/permutations_problem.assets/permutations_i_pruning.png
--- a/chapter_backtracking/permutations_problem.assets/permutations_ii.png
+++ b/chapter_backtracking/permutations_problem.assets/permutations_ii.png
--- a/chapter_backtracking/permutations_problem.assets/permutations_ii_pruning.png
+++ b/chapter_backtracking/permutations_problem.assets/permutations_ii_pruning.png
--- a/chapter_backtracking/permutations_problem.assets/permutations_ii_pruning_summary.png
+++ b/chapter_backtracking/permutations_problem.assets/permutations_ii_pruning_summary.png
--- a/chapter_backtracking/subset_sum_problem.assets/subset_sum_i.png
+++ b/chapter_backtracking/subset_sum_problem.assets/subset_sum_i.png
--- a/chapter_backtracking/subset_sum_problem.assets/subset_sum_i_naive.png
+++ b/chapter_backtracking/subset_sum_problem.assets/subset_sum_i_naive.png
--- a/chapter_backtracking/subset_sum_problem.assets/subset_sum_i_pruning.png
+++ b/chapter_backtracking/subset_sum_problem.assets/subset_sum_i_pruning.png
--- a/chapter_backtracking/subset_sum_problem.assets/subset_sum_ii.png
+++ b/chapter_backtracking/subset_sum_problem.assets/subset_sum_ii.png
--- a/chapter_backtracking/subset_sum_problem.assets/subset_sum_ii_repeat.png
+++ b/chapter_backtracking/subset_sum_problem.assets/subset_sum_ii_repeat.png
--- a/chapter_computational_complexity/iteration_and_recursion.assets/iteration.png
+++ b/chapter_computational_complexity/iteration_and_recursion.assets/iteration.png
--- a/chapter_computational_complexity/iteration_and_recursion.assets/nested_iteration.png
+++ b/chapter_computational_complexity/iteration_and_recursion.assets/nested_iteration.png
--- a/chapter_computational_complexity/iteration_and_recursion.assets/recursion_sum.png
+++ b/chapter_computational_complexity/iteration_and_recursion.assets/recursion_sum.png
--- a/chapter_computational_complexity/iteration_and_recursion.assets/recursion_sum_depth.png
+++ b/chapter_computational_complexity/iteration_and_recursion.assets/recursion_sum_depth.png
--- a/chapter_computational_complexity/iteration_and_recursion.assets/recursion_tree.png
+++ b/chapter_computational_complexity/iteration_and_recursion.assets/recursion_tree.png
--- a/chapter_computational_complexity/iteration_and_recursion.assets/tail_recursion_sum.png
+++ b/chapter_computational_complexity/iteration_and_recursion.assets/tail_recursion_sum.png
--- a/chapter_computational_complexity/space_complexity.assets/space_complexity_common_types.png
+++ b/chapter_computational_complexity/space_complexity.assets/space_complexity_common_types.png
--- a/chapter_computational_complexity/space_complexity.assets/space_complexity_exponential.png
+++ b/chapter_computational_complexity/space_complexity.assets/space_complexity_exponential.png
--- a/chapter_computational_complexity/space_complexity.assets/space_complexity_recursive_linear.png
+++ b/chapter_computational_complexity/space_complexity.assets/space_complexity_recursive_linear.png
--- a/chapter_computational_complexity/space_complexity.assets/space_complexity_recursive_quadratic.png
+++ b/chapter_computational_complexity/space_complexity.assets/space_complexity_recursive_quadratic.png
--- a/chapter_computational_complexity/space_complexity.assets/space_types.png
+++ b/chapter_computational_complexity/space_complexity.assets/space_types.png
--- a/chapter_computational_complexity/time_complexity.assets/asymptotic_upper_bound.png
+++ b/chapter_computational_complexity/time_complexity.assets/asymptotic_upper_bound.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_common_types.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_common_types.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_constant_linear_quadratic.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_constant_linear_quadratic.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_exponential.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_exponential.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_factorial.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_factorial.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_logarithmic.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_logarithmic.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_logarithmic_linear.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_logarithmic_linear.png
--- a/chapter_computational_complexity/time_complexity.assets/time_complexity_simple_example.png
+++ b/chapter_computational_complexity/time_complexity.assets/time_complexity_simple_example.png
--- a/chapter_data_structure/character_encoding.assets/ascii_table.png
+++ b/chapter_data_structure/character_encoding.assets/ascii_table.png
--- a/chapter_data_structure/character_encoding.assets/unicode_hello_algo.png
+++ b/chapter_data_structure/character_encoding.assets/unicode_hello_algo.png
--- a/chapter_data_structure/character_encoding.assets/utf-8_hello_algo.png
+++ b/chapter_data_structure/character_encoding.assets/utf-8_hello_algo.png
--- a/chapter_data_structure/classification_of_data_structure.assets/classification_logic_structure.png
+++ b/chapter_data_structure/classification_of_data_structure.assets/classification_logic_structure.png
--- a/chapter_data_structure/classification_of_data_structure.assets/classification_phisical_structure.png
+++ b/chapter_data_structure/classification_of_data_structure.assets/classification_phisical_structure.png
--- a/chapter_data_structure/classification_of_data_structure.assets/computer_memory_location.png
+++ b/chapter_data_structure/classification_of_data_structure.assets/computer_memory_location.png
--- a/chapter_data_structure/number_encoding.assets/1s_2s_complement.png
+++ b/chapter_data_structure/number_encoding.assets/1s_2s_complement.png
--- a/chapter_data_structure/number_encoding.assets/ieee_754_float.png
+++ b/chapter_data_structure/number_encoding.assets/ieee_754_float.png
--- a/chapter_divide_and_conquer/binary_search_recur.assets/binary_search_recur.png
+++ b/chapter_divide_and_conquer/binary_search_recur.assets/binary_search_recur.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/build_tree_division_pointers.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/build_tree_division_pointers.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/build_tree_example.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/build_tree_example.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/build_tree_preorder_inorder_division.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/build_tree_preorder_inorder_division.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_overall.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_overall.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step1.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step1.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step2.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step2.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step3.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step3.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step4.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step4.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step5.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step5.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step6.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step6.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step7.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step7.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step8.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step8.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step9.png
+++ b/chapter_divide_and_conquer/build_binary_tree_problem.assets/built_tree_step9.png
--- a/chapter_divide_and_conquer/build_binary_tree_problem/index.html
+++ b/chapter_divide_and_conquer/build_binary_tree_problem/index.html
@ -3768,7 +3768,7 @@
 <a id="__codelineno-10-21" name="__codelineno-10-21" href="#__codelineno-10-21"></a><span class="cm">/* 构建二叉树 */</span>
 <a id="__codelineno-10-22" name="__codelineno-10-22" href="#__codelineno-10-22"></a><span class="n">TreeNode</span><span class="w"> </span><span class="o">*</span><span class="nf">buildTree</span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">preorder</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">preorderSize</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">inorder</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">inorderSize</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-10-23" name="__codelineno-10-23" href="#__codelineno-10-23"></a><span class="w">    </span><span class="c1">// 初始化哈希表，存储 inorder 元素到索引的映射</span>
-<a id="__codelineno-10-24" name="__codelineno-10-24" href="#__codelineno-10-24"></a><span class="w">    </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">inorderMap</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="n">malloc</span><span class="p">(</span><span class="k">sizeof</span><span class="p">(</span><span class="kt">int</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_N</span><span class="p">);</span>
+<a id="__codelineno-10-24" name="__codelineno-10-24" href="#__codelineno-10-24"></a><span class="w">    </span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="n">inorderMap</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="o">*</span><span class="p">)</span><span class="n">malloc</span><span class="p">(</span><span class="k">sizeof</span><span class="p">(</span><span class="kt">int</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">MAX_SIZE</span><span class="p">);</span>
 <a id="__codelineno-10-25" name="__codelineno-10-25" href="#__codelineno-10-25"></a><span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">inorderSize</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-10-26" name="__codelineno-10-26" href="#__codelineno-10-26"></a><span class="w">        </span><span class="n">inorderMap</span><span class="p">[</span><span class="n">inorder</span><span class="p">[</span><span class="n">i</span><span class="p">]]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">i</span><span class="p">;</span>
 <a id="__codelineno-10-27" name="__codelineno-10-27" href="#__codelineno-10-27"></a><span class="w">    </span><span class="p">}</span>
--- a/chapter_divide_and_conquer/divide_and_conquer.assets/divide_and_conquer_bubble_sort.png
+++ b/chapter_divide_and_conquer/divide_and_conquer.assets/divide_and_conquer_bubble_sort.png
--- a/chapter_divide_and_conquer/divide_and_conquer.assets/divide_and_conquer_merge_sort.png
+++ b/chapter_divide_and_conquer/divide_and_conquer.assets/divide_and_conquer_merge_sort.png
--- a/chapter_divide_and_conquer/divide_and_conquer.assets/divide_and_conquer_parallel_computing.png
+++ b/chapter_divide_and_conquer/divide_and_conquer.assets/divide_and_conquer_parallel_computing.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_divide_and_conquer.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_divide_and_conquer.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_example.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_example.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f1_step1.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f1_step1.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f1_step2.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f1_step2.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step1.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step1.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step2.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step2.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step3.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step3.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step4.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f2_step4.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step1.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step1.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step2.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step2.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step3.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step3.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step4.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step4.png
--- a/chapter_divide_and_conquer/hanota_problem.assets/hanota_recursive_tree.png
+++ b/chapter_divide_and_conquer/hanota_problem.assets/hanota_recursive_tree.png
--- a/chapter_dynamic_programming/dp_problem_features.assets/climbing_stairs_constraint_example.png
+++ b/chapter_dynamic_programming/dp_problem_features.assets/climbing_stairs_constraint_example.png
--- a/chapter_dynamic_programming/dp_problem_features.assets/climbing_stairs_constraint_state_transfer.png
+++ b/chapter_dynamic_programming/dp_problem_features.assets/climbing_stairs_constraint_state_transfer.png
--- a/chapter_dynamic_programming/dp_problem_features.assets/min_cost_cs_dp.png
+++ b/chapter_dynamic_programming/dp_problem_features.assets/min_cost_cs_dp.png
--- a/Show more
+++ b/Show more