deploy

2024-05-31 17:45:23 +08:00 · 2024-05-31 17:45:23 +08:00 · 6c313b1436
commit 6c313b1436
parent 6abac5a2e7
104 changed files with 114 additions and 65 deletions
--- a/chapter_stack_and_queue/deque/index.html
+++ b/chapter_stack_and_queue/deque/index.html
@ -6523,47 +6523,53 @@
 <a id="__codelineno-32-64" name="__codelineno-32-64" href="#__codelineno-32-64"></a><span class="cm">/* 队首出队 */</span>
 <a id="__codelineno-32-65" name="__codelineno-32-65" href="#__codelineno-32-65"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">popFirst</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-32-66" name="__codelineno-32-66" href="#__codelineno-32-66"></a><span class="w">    </span><span class="nx">num</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">peekFirst</span><span class="p">()</span>
-<a id="__codelineno-32-67" name="__codelineno-32-67" href="#__codelineno-32-67"></a><span class="w">    </span><span class="c1">// 队首指针向后移动一位</span>
-<a id="__codelineno-32-68" name="__codelineno-32-68" href="#__codelineno-32-68"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">index</span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="__codelineno-32-69" name="__codelineno-32-69" href="#__codelineno-32-69"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="o">--</span>
-<a id="__codelineno-32-70" name="__codelineno-32-70" href="#__codelineno-32-70"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">num</span>
-<a id="__codelineno-32-71" name="__codelineno-32-71" href="#__codelineno-32-71"></a><span class="p">}</span>
-<a id="__codelineno-32-72" name="__codelineno-32-72" href="#__codelineno-32-72"></a>
-<a id="__codelineno-32-73" name="__codelineno-32-73" href="#__codelineno-32-73"></a><span class="cm">/* 队尾出队 */</span>
-<a id="__codelineno-32-74" name="__codelineno-32-74" href="#__codelineno-32-74"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">popLast</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-75" name="__codelineno-32-75" href="#__codelineno-32-75"></a><span class="w">    </span><span class="nx">num</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">peekLast</span><span class="p">()</span>
-<a id="__codelineno-32-76" name="__codelineno-32-76" href="#__codelineno-32-76"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="o">--</span>
-<a id="__codelineno-32-77" name="__codelineno-32-77" href="#__codelineno-32-77"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">num</span>
-<a id="__codelineno-32-78" name="__codelineno-32-78" href="#__codelineno-32-78"></a><span class="p">}</span>
-<a id="__codelineno-32-79" name="__codelineno-32-79" href="#__codelineno-32-79"></a>
-<a id="__codelineno-32-80" name="__codelineno-32-80" href="#__codelineno-32-80"></a><span class="cm">/* 访问队首元素 */</span>
-<a id="__codelineno-32-81" name="__codelineno-32-81" href="#__codelineno-32-81"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">peekFirst</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-82" name="__codelineno-32-82" href="#__codelineno-32-82"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-83" name="__codelineno-32-83" href="#__codelineno-32-83"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
-<a id="__codelineno-32-84" name="__codelineno-32-84" href="#__codelineno-32-84"></a><span class="w">    </span><span class="p">}</span>
-<a id="__codelineno-32-85" name="__codelineno-32-85" href="#__codelineno-32-85"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">]</span>
-<a id="__codelineno-32-86" name="__codelineno-32-86" href="#__codelineno-32-86"></a><span class="p">}</span>
-<a id="__codelineno-32-87" name="__codelineno-32-87" href="#__codelineno-32-87"></a>
-<a id="__codelineno-32-88" name="__codelineno-32-88" href="#__codelineno-32-88"></a><span class="cm">/* 访问队尾元素 */</span>
-<a id="__codelineno-32-89" name="__codelineno-32-89" href="#__codelineno-32-89"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">peekLast</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-90" name="__codelineno-32-90" href="#__codelineno-32-90"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-91" name="__codelineno-32-91" href="#__codelineno-32-91"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
-<a id="__codelineno-32-92" name="__codelineno-32-92" href="#__codelineno-32-92"></a><span class="w">    </span><span class="p">}</span>
-<a id="__codelineno-32-93" name="__codelineno-32-93" href="#__codelineno-32-93"></a><span class="w">    </span><span class="c1">// 计算尾元素索引</span>
-<a id="__codelineno-32-94" name="__codelineno-32-94" href="#__codelineno-32-94"></a><span class="w">    </span><span class="nx">last</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">index</span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
-<a id="__codelineno-32-95" name="__codelineno-32-95" href="#__codelineno-32-95"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">last</span><span class="p">]</span>
-<a id="__codelineno-32-96" name="__codelineno-32-96" href="#__codelineno-32-96"></a><span class="p">}</span>
-<a id="__codelineno-32-97" name="__codelineno-32-97" href="#__codelineno-32-97"></a>
-<a id="__codelineno-32-98" name="__codelineno-32-98" href="#__codelineno-32-98"></a><span class="cm">/* 获取 Slice 用于打印 */</span>
-<a id="__codelineno-32-99" name="__codelineno-32-99" href="#__codelineno-32-99"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">toSlice</span><span class="p">()</span><span class="w"> </span><span class="p">[]</span><span class="kt">int</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-100" name="__codelineno-32-100" href="#__codelineno-32-100"></a><span class="w">    </span><span class="c1">// 仅转换有效长度范围内的列表元素</span>
-<a id="__codelineno-32-101" name="__codelineno-32-101" href="#__codelineno-32-101"></a><span class="w">    </span><span class="nx">res</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nb">make</span><span class="p">([]</span><span class="kt">int</span><span class="p">,</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="p">)</span>
-<a id="__codelineno-32-102" name="__codelineno-32-102" href="#__codelineno-32-102"></a><span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="nx">i</span><span class="p">,</span><span class="w"> </span><span class="nx">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="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">;</span><span class="w"> </span><span class="nx">i</span><span class="w"> </span><span class="p">&lt;</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="p">;</span><span class="w"> </span><span class="nx">i</span><span class="o">++</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-103" name="__codelineno-32-103" href="#__codelineno-32-103"></a><span class="w">        </span><span class="nx">res</span><span class="p">[</span><span class="nx">i</span><span class="p">]</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">index</span><span class="p">(</span><span class="nx">j</span><span class="p">)]</span>
-<a id="__codelineno-32-104" name="__codelineno-32-104" href="#__codelineno-32-104"></a><span class="w">        </span><span class="nx">j</span><span class="o">++</span>
-<a id="__codelineno-32-105" name="__codelineno-32-105" href="#__codelineno-32-105"></a><span class="w">    </span><span class="p">}</span>
-<a id="__codelineno-32-106" name="__codelineno-32-106" href="#__codelineno-32-106"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">res</span>
-<a id="__codelineno-32-107" name="__codelineno-32-107" href="#__codelineno-32-107"></a><span class="p">}</span>
+<a id="__codelineno-32-67" name="__codelineno-32-67" href="#__codelineno-32-67"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">num</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="kc">nil</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-68" name="__codelineno-32-68" href="#__codelineno-32-68"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
+<a id="__codelineno-32-69" name="__codelineno-32-69" href="#__codelineno-32-69"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-70" name="__codelineno-32-70" href="#__codelineno-32-70"></a><span class="w">    </span><span class="c1">// 队首指针向后移动一位</span>
+<a id="__codelineno-32-71" name="__codelineno-32-71" href="#__codelineno-32-71"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">index</span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="__codelineno-32-72" name="__codelineno-32-72" href="#__codelineno-32-72"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="o">--</span>
+<a id="__codelineno-32-73" name="__codelineno-32-73" href="#__codelineno-32-73"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">num</span>
+<a id="__codelineno-32-74" name="__codelineno-32-74" href="#__codelineno-32-74"></a><span class="p">}</span>
+<a id="__codelineno-32-75" name="__codelineno-32-75" href="#__codelineno-32-75"></a>
+<a id="__codelineno-32-76" name="__codelineno-32-76" href="#__codelineno-32-76"></a><span class="cm">/* 队尾出队 */</span>
+<a id="__codelineno-32-77" name="__codelineno-32-77" href="#__codelineno-32-77"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">popLast</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-78" name="__codelineno-32-78" href="#__codelineno-32-78"></a><span class="w">    </span><span class="nx">num</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">peekLast</span><span class="p">()</span>
+<a id="__codelineno-32-79" name="__codelineno-32-79" href="#__codelineno-32-79"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">num</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="kc">nil</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-80" name="__codelineno-32-80" href="#__codelineno-32-80"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
+<a id="__codelineno-32-81" name="__codelineno-32-81" href="#__codelineno-32-81"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-82" name="__codelineno-32-82" href="#__codelineno-32-82"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="o">--</span>
+<a id="__codelineno-32-83" name="__codelineno-32-83" href="#__codelineno-32-83"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">num</span>
+<a id="__codelineno-32-84" name="__codelineno-32-84" href="#__codelineno-32-84"></a><span class="p">}</span>
+<a id="__codelineno-32-85" name="__codelineno-32-85" href="#__codelineno-32-85"></a>
+<a id="__codelineno-32-86" name="__codelineno-32-86" href="#__codelineno-32-86"></a><span class="cm">/* 访问队首元素 */</span>
+<a id="__codelineno-32-87" name="__codelineno-32-87" href="#__codelineno-32-87"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">peekFirst</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-88" name="__codelineno-32-88" href="#__codelineno-32-88"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-89" name="__codelineno-32-89" href="#__codelineno-32-89"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
+<a id="__codelineno-32-90" name="__codelineno-32-90" href="#__codelineno-32-90"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-91" name="__codelineno-32-91" href="#__codelineno-32-91"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">]</span>
+<a id="__codelineno-32-92" name="__codelineno-32-92" href="#__codelineno-32-92"></a><span class="p">}</span>
+<a id="__codelineno-32-93" name="__codelineno-32-93" href="#__codelineno-32-93"></a>
+<a id="__codelineno-32-94" name="__codelineno-32-94" href="#__codelineno-32-94"></a><span class="cm">/* 访问队尾元素 */</span>
+<a id="__codelineno-32-95" name="__codelineno-32-95" href="#__codelineno-32-95"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">peekLast</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-96" name="__codelineno-32-96" href="#__codelineno-32-96"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-97" name="__codelineno-32-97" href="#__codelineno-32-97"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
+<a id="__codelineno-32-98" name="__codelineno-32-98" href="#__codelineno-32-98"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-99" name="__codelineno-32-99" href="#__codelineno-32-99"></a><span class="w">    </span><span class="c1">// 计算尾元素索引</span>
+<a id="__codelineno-32-100" name="__codelineno-32-100" href="#__codelineno-32-100"></a><span class="w">    </span><span class="nx">last</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">index</span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<a id="__codelineno-32-101" name="__codelineno-32-101" href="#__codelineno-32-101"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">last</span><span class="p">]</span>
+<a id="__codelineno-32-102" name="__codelineno-32-102" href="#__codelineno-32-102"></a><span class="p">}</span>
+<a id="__codelineno-32-103" name="__codelineno-32-103" href="#__codelineno-32-103"></a>
+<a id="__codelineno-32-104" name="__codelineno-32-104" href="#__codelineno-32-104"></a><span class="cm">/* 获取 Slice 用于打印 */</span>
+<a id="__codelineno-32-105" name="__codelineno-32-105" href="#__codelineno-32-105"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayDeque</span><span class="p">)</span><span class="w"> </span><span class="nx">toSlice</span><span class="p">()</span><span class="w"> </span><span class="p">[]</span><span class="kt">int</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-106" name="__codelineno-32-106" href="#__codelineno-32-106"></a><span class="w">    </span><span class="c1">// 仅转换有效长度范围内的列表元素</span>
+<a id="__codelineno-32-107" name="__codelineno-32-107" href="#__codelineno-32-107"></a><span class="w">    </span><span class="nx">res</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nb">make</span><span class="p">([]</span><span class="kt">int</span><span class="p">,</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="p">)</span>
+<a id="__codelineno-32-108" name="__codelineno-32-108" href="#__codelineno-32-108"></a><span class="w">    </span><span class="k">for</span><span class="w"> </span><span class="nx">i</span><span class="p">,</span><span class="w"> </span><span class="nx">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="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">;</span><span class="w"> </span><span class="nx">i</span><span class="w"> </span><span class="p">&lt;</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="p">;</span><span class="w"> </span><span class="nx">i</span><span class="o">++</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-109" name="__codelineno-32-109" href="#__codelineno-32-109"></a><span class="w">        </span><span class="nx">res</span><span class="p">[</span><span class="nx">i</span><span class="p">]</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">index</span><span class="p">(</span><span class="nx">j</span><span class="p">)]</span>
+<a id="__codelineno-32-110" name="__codelineno-32-110" href="#__codelineno-32-110"></a><span class="w">        </span><span class="nx">j</span><span class="o">++</span>
+<a id="__codelineno-32-111" name="__codelineno-32-111" href="#__codelineno-32-111"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-112" name="__codelineno-32-112" href="#__codelineno-32-112"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">res</span>
+<a id="__codelineno-32-113" name="__codelineno-32-113" href="#__codelineno-32-113"></a><span class="p">}</span>
 </code></pre></div>
 </div>
 <div class="tabbed-block">
--- a/chapter_stack_and_queue/queue/index.html
+++ b/chapter_stack_and_queue/queue/index.html
@ -5441,29 +5441,33 @@
 <a id="__codelineno-32-43" name="__codelineno-32-43" href="#__codelineno-32-43"></a><span class="cm">/* 出队 */</span>
 <a id="__codelineno-32-44" name="__codelineno-32-44" href="#__codelineno-32-44"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayQueue</span><span class="p">)</span><span class="w"> </span><span class="nx">pop</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
 <a id="__codelineno-32-45" name="__codelineno-32-45" href="#__codelineno-32-45"></a><span class="w">    </span><span class="nx">num</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">peek</span><span class="p">()</span>
-<a id="__codelineno-32-46" name="__codelineno-32-46" href="#__codelineno-32-46"></a><span class="w">    </span><span class="c1">// 队首指针向后移动一位，若越过尾部，则返回到数组头部</span>
-<a id="__codelineno-32-47" name="__codelineno-32-47" href="#__codelineno-32-47"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</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="nx">q</span><span class="p">.</span><span class="nx">queCapacity</span>
-<a id="__codelineno-32-48" name="__codelineno-32-48" href="#__codelineno-32-48"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="o">--</span>
-<a id="__codelineno-32-49" name="__codelineno-32-49" href="#__codelineno-32-49"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">num</span>
-<a id="__codelineno-32-50" name="__codelineno-32-50" href="#__codelineno-32-50"></a><span class="p">}</span>
-<a id="__codelineno-32-51" name="__codelineno-32-51" href="#__codelineno-32-51"></a>
-<a id="__codelineno-32-52" name="__codelineno-32-52" href="#__codelineno-32-52"></a><span class="cm">/* 访问队首元素 */</span>
-<a id="__codelineno-32-53" name="__codelineno-32-53" href="#__codelineno-32-53"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayQueue</span><span class="p">)</span><span class="w"> </span><span class="nx">peek</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-54" name="__codelineno-32-54" href="#__codelineno-32-54"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-55" name="__codelineno-32-55" href="#__codelineno-32-55"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
-<a id="__codelineno-32-56" name="__codelineno-32-56" href="#__codelineno-32-56"></a><span class="w">    </span><span class="p">}</span>
-<a id="__codelineno-32-57" name="__codelineno-32-57" href="#__codelineno-32-57"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">]</span>
-<a id="__codelineno-32-58" name="__codelineno-32-58" href="#__codelineno-32-58"></a><span class="p">}</span>
-<a id="__codelineno-32-59" name="__codelineno-32-59" href="#__codelineno-32-59"></a>
-<a id="__codelineno-32-60" name="__codelineno-32-60" href="#__codelineno-32-60"></a><span class="cm">/* 获取 Slice 用于打印 */</span>
-<a id="__codelineno-32-61" name="__codelineno-32-61" href="#__codelineno-32-61"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayQueue</span><span class="p">)</span><span class="w"> </span><span class="nx">toSlice</span><span class="p">()</span><span class="w"> </span><span class="p">[]</span><span class="kt">int</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-62" name="__codelineno-32-62" href="#__codelineno-32-62"></a><span class="w">    </span><span class="nx">rear</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="p">)</span>
-<a id="__codelineno-32-63" name="__codelineno-32-63" href="#__codelineno-32-63"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">rear</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queCapacity</span><span class="w"> </span><span class="p">{</span>
-<a id="__codelineno-32-64" name="__codelineno-32-64" href="#__codelineno-32-64"></a><span class="w">        </span><span class="nx">rear</span><span class="w"> </span><span class="o">%=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queCapacity</span>
-<a id="__codelineno-32-65" name="__codelineno-32-65" href="#__codelineno-32-65"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="nb">append</span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">:],</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[:</span><span class="nx">rear</span><span class="p">]</span><span class="o">...</span><span class="p">)</span>
-<a id="__codelineno-32-66" name="__codelineno-32-66" href="#__codelineno-32-66"></a><span class="w">    </span><span class="p">}</span>
-<a id="__codelineno-32-67" name="__codelineno-32-67" href="#__codelineno-32-67"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">:</span><span class="nx">rear</span><span class="p">]</span>
-<a id="__codelineno-32-68" name="__codelineno-32-68" href="#__codelineno-32-68"></a><span class="p">}</span>
+<a id="__codelineno-32-46" name="__codelineno-32-46" href="#__codelineno-32-46"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">num</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="kc">nil</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-47" name="__codelineno-32-47" href="#__codelineno-32-47"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
+<a id="__codelineno-32-48" name="__codelineno-32-48" href="#__codelineno-32-48"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-49" name="__codelineno-32-49" href="#__codelineno-32-49"></a>
+<a id="__codelineno-32-50" name="__codelineno-32-50" href="#__codelineno-32-50"></a><span class="w">    </span><span class="c1">// 队首指针向后移动一位，若越过尾部，则返回到数组头部</span>
+<a id="__codelineno-32-51" name="__codelineno-32-51" href="#__codelineno-32-51"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="p">=</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</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="nx">q</span><span class="p">.</span><span class="nx">queCapacity</span>
+<a id="__codelineno-32-52" name="__codelineno-32-52" href="#__codelineno-32-52"></a><span class="w">    </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="o">--</span>
+<a id="__codelineno-32-53" name="__codelineno-32-53" href="#__codelineno-32-53"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">num</span>
+<a id="__codelineno-32-54" name="__codelineno-32-54" href="#__codelineno-32-54"></a><span class="p">}</span>
+<a id="__codelineno-32-55" name="__codelineno-32-55" href="#__codelineno-32-55"></a>
+<a id="__codelineno-32-56" name="__codelineno-32-56" href="#__codelineno-32-56"></a><span class="cm">/* 访问队首元素 */</span>
+<a id="__codelineno-32-57" name="__codelineno-32-57" href="#__codelineno-32-57"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayQueue</span><span class="p">)</span><span class="w"> </span><span class="nx">peek</span><span class="p">()</span><span class="w"> </span><span class="kt">any</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-58" name="__codelineno-32-58" href="#__codelineno-32-58"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">isEmpty</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-59" name="__codelineno-32-59" href="#__codelineno-32-59"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="kc">nil</span>
+<a id="__codelineno-32-60" name="__codelineno-32-60" href="#__codelineno-32-60"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-61" name="__codelineno-32-61" href="#__codelineno-32-61"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">]</span>
+<a id="__codelineno-32-62" name="__codelineno-32-62" href="#__codelineno-32-62"></a><span class="p">}</span>
+<a id="__codelineno-32-63" name="__codelineno-32-63" href="#__codelineno-32-63"></a>
+<a id="__codelineno-32-64" name="__codelineno-32-64" href="#__codelineno-32-64"></a><span class="cm">/* 获取 Slice 用于打印 */</span>
+<a id="__codelineno-32-65" name="__codelineno-32-65" href="#__codelineno-32-65"></a><span class="kd">func</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="w"> </span><span class="o">*</span><span class="nx">arrayQueue</span><span class="p">)</span><span class="w"> </span><span class="nx">toSlice</span><span class="p">()</span><span class="w"> </span><span class="p">[]</span><span class="kt">int</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-66" name="__codelineno-32-66" href="#__codelineno-32-66"></a><span class="w">    </span><span class="nx">rear</span><span class="w"> </span><span class="o">:=</span><span class="w"> </span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queSize</span><span class="p">)</span>
+<a id="__codelineno-32-67" name="__codelineno-32-67" href="#__codelineno-32-67"></a><span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="nx">rear</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queCapacity</span><span class="w"> </span><span class="p">{</span>
+<a id="__codelineno-32-68" name="__codelineno-32-68" href="#__codelineno-32-68"></a><span class="w">        </span><span class="nx">rear</span><span class="w"> </span><span class="o">%=</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">queCapacity</span>
+<a id="__codelineno-32-69" name="__codelineno-32-69" href="#__codelineno-32-69"></a><span class="w">        </span><span class="k">return</span><span class="w"> </span><span class="nb">append</span><span class="p">(</span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">:],</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[:</span><span class="nx">rear</span><span class="p">]</span><span class="o">...</span><span class="p">)</span>
+<a id="__codelineno-32-70" name="__codelineno-32-70" href="#__codelineno-32-70"></a><span class="w">    </span><span class="p">}</span>
+<a id="__codelineno-32-71" name="__codelineno-32-71" href="#__codelineno-32-71"></a><span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="nx">q</span><span class="p">.</span><span class="nx">nums</span><span class="p">[</span><span class="nx">q</span><span class="p">.</span><span class="nx">front</span><span class="p">:</span><span class="nx">rear</span><span class="p">]</span>
+<a id="__codelineno-32-72" name="__codelineno-32-72" href="#__codelineno-32-72"></a><span class="p">}</span>
 </code></pre></div>
 </div>
 <div class="tabbed-block">
--- a/en/chapter_backtracking/backtracking_algorithm.assets/backtrack_remove_return_or_not.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/backtrack_remove_return_or_not.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step1.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step1.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step10.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step10.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step11.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step11.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step2.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step2.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step3.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step3.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step4.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step4.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step5.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step5.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step7.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step7.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step8.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step8.png
--- a/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step9.png
+++ b/en/chapter_backtracking/backtracking_algorithm.assets/preorder_find_paths_step9.png
--- a/en/chapter_backtracking/n_queens_problem.assets/n_queens_constraints.png
+++ b/en/chapter_backtracking/n_queens_problem.assets/n_queens_constraints.png
--- a/en/chapter_backtracking/permutations_problem.assets/permutations_i_pruning.png
+++ b/en/chapter_backtracking/permutations_problem.assets/permutations_i_pruning.png
--- a/en/chapter_backtracking/permutations_problem.assets/permutations_ii.png
+++ b/en/chapter_backtracking/permutations_problem.assets/permutations_ii.png
--- a/en/chapter_backtracking/permutations_problem.assets/permutations_ii_pruning.png
+++ b/en/chapter_backtracking/permutations_problem.assets/permutations_ii_pruning.png
--- a/en/chapter_backtracking/subset_sum_problem.assets/subset_sum_i.png
+++ b/en/chapter_backtracking/subset_sum_problem.assets/subset_sum_i.png
--- a/en/chapter_backtracking/subset_sum_problem.assets/subset_sum_i_pruning.png
+++ b/en/chapter_backtracking/subset_sum_problem.assets/subset_sum_i_pruning.png
--- a/en/chapter_backtracking/subset_sum_problem.assets/subset_sum_ii.png
+++ b/en/chapter_backtracking/subset_sum_problem.assets/subset_sum_ii.png
--- a/en/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step1.png
+++ b/en/chapter_divide_and_conquer/hanota_problem.assets/hanota_f3_step1.png
--- a/en/chapter_dynamic_programming/dp_problem_features.assets/climbing_stairs_constraint_example.png
+++ b/en/chapter_dynamic_programming/dp_problem_features.assets/climbing_stairs_constraint_example.png
--- a/en/chapter_dynamic_programming/dp_problem_features.assets/min_cost_cs_example.png
+++ b/en/chapter_dynamic_programming/dp_problem_features.assets/min_cost_cs_example.png
--- a/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_dp_step1.png
+++ b/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_dp_step1.png
--- a/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_dp_step12.png
+++ b/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_dp_step12.png
--- a/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_initial_state.png
+++ b/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_initial_state.png
--- a/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_state_definition.png
+++ b/en/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_state_definition.png
--- a/en/chapter_dynamic_programming/edit_distance_problem.assets/edit_distance_dp_step2.png
+++ b/en/chapter_dynamic_programming/edit_distance_problem.assets/edit_distance_dp_step2.png
--- a/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_dfs_memo_tree.png
+++ b/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_dfs_memo_tree.png
--- a/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_dfs_tree.png
+++ b/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_dfs_tree.png
--- a/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_dp.png
+++ b/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_dp.png
--- a/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_example.png
+++ b/en/chapter_dynamic_programming/intro_to_dynamic_programming.assets/climbing_stairs_example.png
--- a/en/chapter_dynamic_programming/knapsack_problem.assets/knapsack_dfs.png
+++ b/en/chapter_dynamic_programming/knapsack_problem.assets/knapsack_dfs.png
--- a/en/chapter_dynamic_programming/knapsack_problem.assets/knapsack_dfs_mem.png
+++ b/en/chapter_dynamic_programming/knapsack_problem.assets/knapsack_dfs_mem.png
--- a/en/chapter_dynamic_programming/knapsack_problem.assets/knapsack_dp_step14.png
+++ b/en/chapter_dynamic_programming/knapsack_problem.assets/knapsack_dp_step14.png
--- a/en/chapter_dynamic_programming/unbounded_knapsack_problem.assets/coin_change_dp_step2.png
+++ b/en/chapter_dynamic_programming/unbounded_knapsack_problem.assets/coin_change_dp_step2.png
--- a/en/chapter_dynamic_programming/unbounded_knapsack_problem.assets/coin_change_example.png
+++ b/en/chapter_dynamic_programming/unbounded_knapsack_problem.assets/coin_change_example.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_list_step1_initialization.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_list_step1_initialization.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_list_step2_add_edge.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_list_step2_add_edge.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_list_step3_remove_edge.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_list_step3_remove_edge.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_list_step4_add_vertex.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_list_step4_add_vertex.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_list_step5_remove_vertex.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_list_step5_remove_vertex.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_matrix_step1_initialization.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_matrix_step1_initialization.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_matrix_step2_add_edge.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_matrix_step2_add_edge.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_matrix_step3_remove_edge.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_matrix_step3_remove_edge.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_matrix_step4_add_vertex.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_matrix_step4_add_vertex.png
--- a/en/chapter_graph/graph_operations.assets/adjacency_matrix_step5_remove_vertex.png
+++ b/en/chapter_graph/graph_operations.assets/adjacency_matrix_step5_remove_vertex.png
--- a/en/chapter_greedy/fractional_knapsack_problem.assets/fractional_knapsack_example.png
+++ b/en/chapter_greedy/fractional_knapsack_problem.assets/fractional_knapsack_example.png
--- a/en/chapter_greedy/greedy_algorithm.assets/coin_change_greedy_strategy.png
+++ b/en/chapter_greedy/greedy_algorithm.assets/coin_change_greedy_strategy.png
--- a/en/chapter_greedy/greedy_algorithm.assets/coin_change_greedy_vs_dp.png
+++ b/en/chapter_greedy/greedy_algorithm.assets/coin_change_greedy_vs_dp.png
--- a/en/chapter_greedy/max_capacity_problem.assets/max_capacity_moving_long_board.png
+++ b/en/chapter_greedy/max_capacity_problem.assets/max_capacity_moving_long_board.png
--- a/en/chapter_greedy/max_capacity_problem.assets/max_capacity_moving_short_board.png
+++ b/en/chapter_greedy/max_capacity_problem.assets/max_capacity_moving_short_board.png
--- a/en/chapter_greedy/max_product_cutting_problem.assets/max_product_cutting_greedy_infer1.png
+++ b/en/chapter_greedy/max_product_cutting_problem.assets/max_product_cutting_greedy_infer1.png
--- a/en/chapter_hashing/hash_map.assets/hash_table_reshash.png
+++ b/en/chapter_hashing/hash_map.assets/hash_table_reshash.png
--- a/en/chapter_heap/build_heap.assets/heapify_operations_count.png
+++ b/en/chapter_heap/build_heap.assets/heapify_operations_count.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step1.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step1.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step2.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step2.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step3.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step3.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step4.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step4.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step5.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step5.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step6.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step6.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step7.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step7.png
--- a/en/chapter_heap/top_k.assets/top_k_heap_step8.png
+++ b/en/chapter_heap/top_k.assets/top_k_heap_step8.png
--- a/en/chapter_heap/top_k.assets/top_k_traversal.png
+++ b/en/chapter_heap/top_k.assets/top_k_traversal.png
--- a/en/chapter_searching/binary_search_insertion.assets/binary_search_insertion_naive.png
+++ b/en/chapter_searching/binary_search_insertion.assets/binary_search_insertion_naive.png
--- a/en/chapter_searching/replace_linear_by_hashing.assets/two_sum_brute_force.png
+++ b/en/chapter_searching/replace_linear_by_hashing.assets/two_sum_brute_force.png
--- a/en/chapter_sorting/bubble_sort.assets/bubble_sort_overview.png
+++ b/en/chapter_sorting/bubble_sort.assets/bubble_sort_overview.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step1.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step1.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step10.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step10.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step11.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step11.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step12.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step12.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step2.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step2.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step3.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step3.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step4.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step4.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step5.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step5.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step6.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step6.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step7.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step7.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step8.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step8.png
--- a/en/chapter_sorting/heap_sort.assets/heap_sort_step9.png
+++ b/en/chapter_sorting/heap_sort.assets/heap_sort_step9.png
--- a/en/chapter_sorting/insertion_sort.assets/insertion_operation.png
+++ b/en/chapter_sorting/insertion_sort.assets/insertion_operation.png
--- a/en/chapter_sorting/quick_sort.assets/pivot_division_step4.png
+++ b/en/chapter_sorting/quick_sort.assets/pivot_division_step4.png
--- a/en/chapter_sorting/quick_sort.assets/pivot_division_step8.png
+++ b/en/chapter_sorting/quick_sort.assets/pivot_division_step8.png
--- a/en/chapter_sorting/selection_sort.assets/selection_sort_step11.png
+++ b/en/chapter_sorting/selection_sort.assets/selection_sort_step11.png
--- a/en/chapter_sorting/selection_sort.assets/selection_sort_step8.png
+++ b/en/chapter_sorting/selection_sort.assets/selection_sort_step8.png
--- a/en/chapter_tree/avl_tree.assets/avltree_degradation_from_inserting_node.png
+++ b/en/chapter_tree/avl_tree.assets/avltree_degradation_from_inserting_node.png
--- a/en/chapter_tree/avl_tree.assets/avltree_degradation_from_removing_node.png
+++ b/en/chapter_tree/avl_tree.assets/avltree_degradation_from_removing_node.png
--- a/en/chapter_tree/avl_tree.assets/avltree_right_rotate_step3.png
+++ b/en/chapter_tree/avl_tree.assets/avltree_right_rotate_step3.png
--- a/en/chapter_tree/avl_tree.assets/avltree_right_rotate_step4.png
+++ b/en/chapter_tree/avl_tree.assets/avltree_right_rotate_step4.png
--- a/en/chapter_tree/avl_tree.assets/avltree_rotation_cases.png
+++ b/en/chapter_tree/avl_tree.assets/avltree_rotation_cases.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_degradation.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_degradation.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_inorder_traversal.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_inorder_traversal.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_insert.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_insert.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_remove_case1.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_remove_case1.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_remove_case2.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_remove_case2.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step1.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step1.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step2.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step2.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step3.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step3.png
--- a/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step4.png
+++ b/en/chapter_tree/binary_search_tree.assets/bst_remove_case3_step4.png
--- a/en/index.html
+++ b/en/index.html
@ -572,6 +572,19 @@
                  </sub>
                </a>
              </div>
+              <div class="profile-cell">
+                <a href="https://github.com/khoaxuantu">
+                  <img alt="Reviewer: khoaxuantu" class="profile-img" src="../assets/avatar/avatar_khoaxuantu.jpg"/>
+                  <br/>
+                  <b>
+                    khoaxuantu
+                  </b>
+                  <br/>
+                  <sub>
+                    Ruby
+                  </sub>
+                </a>
+              </div>
              <div class="profile-cell">
                <a href="https://github.com/krahets">
                  <img alt="Reviewer: krahets" class="profile-img" src="../assets/avatar/avatar_krahets.jpg"/>
--- a/en/sitemap.xml.gz
+++ b/en/sitemap.xml.gz
--- a/Show More
+++ b/Show More