xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-14 16:16:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-05-04 05:22:36 +08:00
parent 0dbd0cd517
commit 73dc37df52
64 changed files with 1416 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_tree/array_representation_of_tree/index.html
+16
View File
@@ -1627,6 +1627,8 @@
<label class="md-nav__link" for="__nav_14" id="__nav_14_label" tabindex="0">
@@ -1669,6 +1671,20 @@
<li class="md-nav__item">
<a href="../../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.3. &nbsp; n 皇后问题（New）
</a>
</li>
</ul>
</nav>
</li>
chapter_tree/avl_tree/index.html
+17 -1
View File
@@ -1722,6 +1722,8 @@
<label class="md-nav__link" for="__nav_14" id="__nav_14_label" tabindex="0">
@@ -1764,6 +1766,20 @@
<li class="md-nav__item">
<a href="../../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.3. &nbsp; n 皇后问题（New）
</a>
</li>
</ul>
</nav>
</li>
@@ -3865,7 +3881,7 @@
<a id="__codelineno-78-28" name="__codelineno-78-28" href="#__codelineno-78-28"></a> <span class="p">}</span>
<a id="__codelineno-78-29" name="__codelineno-78-29" href="#__codelineno-78-29"></a> <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
<a id="__codelineno-78-30" name="__codelineno-78-30" href="#__codelineno-78-30"></a> <span class="c1">// 子节点数量 = 2 ，则将中序遍历的下个节点删除，并用该节点替换当前节点</span>
<a id="__codelineno-78-31" name="__codelineno-78-31" href="#__codelineno-78-31"></a> <span class="kd">let</span> <span class="nv">temp</span> <span class="p">=</span> <span class="n">node</span><span class="p">?.</span><span class="kr">right</span>
<a id="__codelineno-78-31" name="__codelineno-78-31" href="#__codelineno-78-31"></a> <span class="kd">var</span> <span class="nv">temp</span> <span class="p">=</span> <span class="n">node</span><span class="p">?.</span><span class="kr">right</span>
<a id="__codelineno-78-32" name="__codelineno-78-32" href="#__codelineno-78-32"></a> <span class="k">while</span> <span class="n">temp</span><span class="p">?.</span><span class="kr">left</span> <span class="o">!=</span> <span class="kc">nil</span> <span class="p">{</span>
<a id="__codelineno-78-33" name="__codelineno-78-33" href="#__codelineno-78-33"></a> <span class="n">temp</span> <span class="p">=</span> <span class="n">temp</span><span class="p">?.</span><span class="kr">left</span>
<a id="__codelineno-78-34" name="__codelineno-78-34" href="#__codelineno-78-34"></a> <span class="p">}</span>
chapter_tree/binary_search_tree/index.html
+17 -1
View File
@@ -1661,6 +1661,8 @@
<label class="md-nav__link" for="__nav_14" id="__nav_14_label" tabindex="0">
@@ -1703,6 +1705,20 @@
<li class="md-nav__item">
<a href="../../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.3. &nbsp; n 皇后问题（New）
</a>
</li>
</ul>
</nav>
</li>
@@ -2959,7 +2975,7 @@
<a id="__codelineno-28-41" name="__codelineno-28-41" href="#__codelineno-28-41"></a> <span class="c1">// 子节点数量 = 2</span>
<a id="__codelineno-28-42" name="__codelineno-28-42" href="#__codelineno-28-42"></a> <span class="k">else</span> <span class="p">{</span>
<a id="__codelineno-28-43" name="__codelineno-28-43" href="#__codelineno-28-43"></a> <span class="c1">// 获取中序遍历中 cur 的下一个节点</span>
<a id="__codelineno-28-44" name="__codelineno-28-44" href="#__codelineno-28-44"></a> <span class="kd">let</span> <span class="nv">tmp</span> <span class="p">=</span> <span class="n">cur</span><span class="p">?.</span><span class="kr">right</span>
<a id="__codelineno-28-44" name="__codelineno-28-44" href="#__codelineno-28-44"></a> <span class="kd">var</span> <span class="nv">tmp</span> <span class="p">=</span> <span class="n">cur</span><span class="p">?.</span><span class="kr">right</span>
<a id="__codelineno-28-45" name="__codelineno-28-45" href="#__codelineno-28-45"></a> <span class="k">while</span> <span class="n">tmp</span><span class="p">?.</span><span class="kr">left</span> <span class="o">!=</span> <span class="kc">nil</span> <span class="p">{</span>
<a id="__codelineno-28-46" name="__codelineno-28-46" href="#__codelineno-28-46"></a> <span class="n">tmp</span> <span class="p">=</span> <span class="n">tmp</span><span class="p">?.</span><span class="kr">left</span>
<a id="__codelineno-28-47" name="__codelineno-28-47" href="#__codelineno-28-47"></a> <span class="p">}</span>
chapter_tree/binary_tree/index.html
+16
View File
@@ -1668,6 +1668,8 @@
<label class="md-nav__link" for="__nav_14" id="__nav_14_label" tabindex="0">
@@ -1710,6 +1712,20 @@
<li class="md-nav__item">
<a href="../../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.3. &nbsp; n 皇后问题（New）
</a>
</li>
</ul>
</nav>
</li>
chapter_tree/binary_tree_traversal/index.html
+16
View File
@@ -1660,6 +1660,8 @@
<label class="md-nav__link" for="__nav_14" id="__nav_14_label" tabindex="0">
@@ -1702,6 +1704,20 @@
<li class="md-nav__item">
<a href="../../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.3. &nbsp; n 皇后问题（New）
</a>
</li>
</ul>
</nav>
</li>
chapter_tree/summary/index.html
+16
View File
@@ -1582,6 +1582,8 @@
<label class="md-nav__link" for="__nav_14" id="__nav_14_label" tabindex="0">
@@ -1624,6 +1626,20 @@
<li class="md-nav__item">
<a href="../../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.3. &nbsp; n 皇后问题（New）
</a>
</li>
</ul>
</nav>
</li>