mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-11 14:45:38 +08:00
deploy
This commit is contained in:
@@ -3587,7 +3587,7 @@
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_nodes.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="在前序遍历中搜索节点" src="../backtracking_algorithm.assets/preorder_find_nodes.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_nodes.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="在前序遍历中搜索节点" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_nodes.png" /></a></p>
|
||||
<p align="center"> 图 13-1 在前序遍历中搜索节点 </p>
|
||||
|
||||
<h2 id="1311">13.1.1 尝试与回退<a class="headerlink" href="#1311" title="Permanent link">¶</a></h2>
|
||||
@@ -3832,37 +3832,37 @@
|
||||
<div class="tabbed-set tabbed-alternate" data-tabs="3:11"><input checked="checked" id="__tabbed_3_1" name="__tabbed_3" type="radio" /><input id="__tabbed_3_2" name="__tabbed_3" type="radio" /><input id="__tabbed_3_3" name="__tabbed_3" type="radio" /><input id="__tabbed_3_4" name="__tabbed_3" type="radio" /><input id="__tabbed_3_5" name="__tabbed_3" type="radio" /><input id="__tabbed_3_6" name="__tabbed_3" type="radio" /><input id="__tabbed_3_7" name="__tabbed_3" type="radio" /><input id="__tabbed_3_8" name="__tabbed_3" type="radio" /><input id="__tabbed_3_9" name="__tabbed_3" type="radio" /><input id="__tabbed_3_10" name="__tabbed_3" type="radio" /><input id="__tabbed_3_11" name="__tabbed_3" type="radio" /><div class="tabbed-labels"><label for="__tabbed_3_1"><1></label><label for="__tabbed_3_2"><2></label><label for="__tabbed_3_3"><3></label><label for="__tabbed_3_4"><4></label><label for="__tabbed_3_5"><5></label><label for="__tabbed_3_6"><6></label><label for="__tabbed_3_7"><7></label><label for="__tabbed_3_8"><8></label><label for="__tabbed_3_9"><9></label><label for="__tabbed_3_10"><10></label><label for="__tabbed_3_11"><11></label></div>
|
||||
<div class="tabbed-content">
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step1.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="尝试与回退" src="../backtracking_algorithm.assets/preorder_find_paths_step1.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step1.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="尝试与回退" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step1.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step2.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step2" src="../backtracking_algorithm.assets/preorder_find_paths_step2.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step2.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step2" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step2.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step3.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step3" src="../backtracking_algorithm.assets/preorder_find_paths_step3.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step3.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step3" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step3.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step4.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step4" src="../backtracking_algorithm.assets/preorder_find_paths_step4.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step4.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step4" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step4.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step5.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step5" src="../backtracking_algorithm.assets/preorder_find_paths_step5.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step5.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step5" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step5.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step6.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step6" src="../backtracking_algorithm.assets/preorder_find_paths_step6.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step6.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step6" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step6.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step7.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step7" src="../backtracking_algorithm.assets/preorder_find_paths_step7.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step7.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step7" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step7.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step8.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step8" src="../backtracking_algorithm.assets/preorder_find_paths_step8.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step8.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step8" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step8.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step9.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step9" src="../backtracking_algorithm.assets/preorder_find_paths_step9.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step9.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step9" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step9.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step10.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step10" src="../backtracking_algorithm.assets/preorder_find_paths_step10.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step10.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step10" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step10.png" /></a></p>
|
||||
</div>
|
||||
<div class="tabbed-block">
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step11.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step11" src="../backtracking_algorithm.assets/preorder_find_paths_step11.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_paths_step11.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_find_paths_step11" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_paths_step11.png" /></a></p>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
@@ -4114,7 +4114,7 @@
|
||||
</div>
|
||||
</div>
|
||||
<p>剪枝是一个非常形象的名词。如图 13-3 所示,在搜索过程中,<strong>我们“剪掉”了不满足约束条件的搜索分支</strong>,避免许多无意义的尝试,从而提高了搜索效率。</p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_constrained_paths.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="根据约束条件剪枝" src="../backtracking_algorithm.assets/preorder_find_constrained_paths.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/preorder_find_constrained_paths.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="根据约束条件剪枝" class="animation-figure" src="../backtracking_algorithm.assets/preorder_find_constrained_paths.png" /></a></p>
|
||||
<p align="center"> 图 13-3 根据约束条件剪枝 </p>
|
||||
|
||||
<h2 id="1313">13.1.3 框架代码<a class="headerlink" href="#1313" title="Permanent link">¶</a></h2>
|
||||
@@ -4944,7 +4944,7 @@
|
||||
</div>
|
||||
</div>
|
||||
<p>根据题意,我们在找到值为 <span class="arithmatex">\(7\)</span> 的节点后应该继续搜索,<strong>因此需要将记录解之后的 <code>return</code> 语句删除</strong>。图 13-4 对比了保留或删除 <code>return</code> 语句的搜索过程。</p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/backtrack_remove_return_or_not.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="保留与删除 return 的搜索过程对比" src="../backtracking_algorithm.assets/backtrack_remove_return_or_not.png" /></a></p>
|
||||
<p><a class="glightbox" href="../backtracking_algorithm.assets/backtrack_remove_return_or_not.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="保留与删除 return 的搜索过程对比" class="animation-figure" src="../backtracking_algorithm.assets/backtrack_remove_return_or_not.png" /></a></p>
|
||||
<p align="center"> 图 13-4 保留与删除 return 的搜索过程对比 </p>
|
||||
|
||||
<p>相比基于前序遍历的代码实现,基于回溯算法框架的代码实现虽然显得啰嗦,但通用性更好。实际上,<strong>许多回溯问题都可以在该框架下解决</strong>。我们只需根据具体问题来定义 <code>state</code> 和 <code>choices</code> ,并实现框架中的各个方法即可。</p>
|
||||
|
||||
Reference in New Issue
Block a user