deploy

2026-07-22 11:26:07 +00:00 · 2026-07-19 07:20:12 +08:00
parent 9895fa286c
commit 858a7888ea
226 changed files with 50 additions and 1152 deletions
@@ -4984,8 +4984,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="46">4.6 &nbsp; 练习<a class="headerlink" href="#46" title="Permanent link">&para;</a></h1>
 <h2 id="461">4.6.1 &nbsp; 知识巩固<a class="headerlink" href="#461" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 数组和链表怎样找到元素<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="136">13.6 &nbsp; 练习<a class="headerlink" href="#136" title="Permanent link">&para;</a></h1>
 <h2 id="1361">13.6.1 &nbsp; 知识巩固<a class="headerlink" href="#1361" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 这段排列算法会漏掉结果吗<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="26">2.6 &nbsp; 练习<a class="headerlink" href="#26" title="Permanent link">&para;</a></h1>
 <h2 id="261">2.6.1 &nbsp; 知识巩固<a class="headerlink" href="#261" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 迭代与递归的时间和空间<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="36">3.6 &nbsp; 练习<a class="headerlink" href="#36" title="Permanent link">&para;</a></h1>
 <h2 id="361">3.6.1 &nbsp; 知识巩固<a class="headerlink" href="#361" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 生活场景中的数据关系<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="126">12.6 &nbsp; 练习<a class="headerlink" href="#126" title="Permanent link">&para;</a></h1>
 <h2 id="1261">12.6.1 &nbsp; 知识巩固<a class="headerlink" href="#1261" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 哪些任务适合分治<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4984,8 +4984,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="148">14.8 &nbsp; 练习<a class="headerlink" href="#148" title="Permanent link">&para;</a></h1>
 <h2 id="1481">14.8.1 &nbsp; 知识巩固<a class="headerlink" href="#1481" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 什么时候适合使用动态规划<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="95">9.5 &nbsp; 练习<a class="headerlink" href="#95" title="Permanent link">&para;</a></h1>
 <h2 id="951">9.5.1 &nbsp; 知识巩固<a class="headerlink" href="#951" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 用两种方式表示同一张图<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="156">15.6 &nbsp; 练习<a class="headerlink" href="#156" title="Permanent link">&para;</a></h1>
 <h2 id="1561">15.6.1 &nbsp; 知识巩固<a class="headerlink" href="#1561" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 每次选最大硬币一定最好吗<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="65">6.5 &nbsp; 练习<a class="headerlink" href="#65" title="Permanent link">&para;</a></h1>
 <h2 id="651">6.5.1 &nbsp; 知识巩固<a class="headerlink" href="#651" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 发生哈希冲突后怎样查找<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="85">8.5 &nbsp; 练习<a class="headerlink" href="#85" title="Permanent link">&para;</a></h1>
 <h2 id="851">8.5.1 &nbsp; 知识巩固<a class="headerlink" href="#851" title="Permanent link">&para;</a></h2>
 <h3 id="1-10">1. &nbsp; 数字 10 入堆后怎样调整<a class="headerlink" href="#1-10" title="Permanent link">&para;</a></h3>
@@ -4984,8 +4984,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="107">10.7 &nbsp; 练习<a class="headerlink" href="#107" title="Permanent link">&para;</a></h1>
 <h2 id="1071">10.7.1 &nbsp; 知识巩固<a class="headerlink" href="#1071" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 二分查找怎样缩小搜索区间<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4984,8 +4984,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="1112">11.12 &nbsp; 练习<a class="headerlink" href="#1112" title="Permanent link">&para;</a></h1>
 <h2 id="11121">11.12.1 &nbsp; 知识巩固<a class="headerlink" href="#11121" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 选择排序和冒泡排序的前几轮<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4962,8 +4962,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="55">5.5 &nbsp; 练习<a class="headerlink" href="#55" title="Permanent link">&para;</a></h1>
 <h2 id="551">5.5.1 &nbsp; 知识巩固<a class="headerlink" href="#551" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 栈和队列会先取出谁<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -5006,8 +5006,6 @@


 <!-- Page content -->
-<!-- 此文件由 utils/exercises/publish_exercises.py 根据 exercises.yaml 自动生成，请勿直接修改。 -->
-
 <h1 id="77">7.7 &nbsp; 练习<a class="headerlink" href="#77" title="Permanent link">&para;</a></h1>
 <h2 id="771">7.7.1 &nbsp; 知识巩固<a class="headerlink" href="#771" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 完全、完满与完美二叉树<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="46-exercises">4.6 &nbsp; Exercises<a class="headerlink" href="#46-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="461-concept-review">4.6.1 &nbsp; Concept Review<a class="headerlink" href="#461-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-how-arrays-and-linked-lists-find-an-element">1. &nbsp; How Arrays and Linked Lists Find an Element<a class="headerlink" href="#1-how-arrays-and-linked-lists-find-an-element" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="136-exercises">13.6 &nbsp; Exercises<a class="headerlink" href="#136-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="1361-concept-review">13.6.1 &nbsp; Concept Review<a class="headerlink" href="#1361-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-will-this-permutation-algorithm-miss-results">1. &nbsp; Will This Permutation Algorithm Miss Results?<a class="headerlink" href="#1-will-this-permutation-algorithm-miss-results" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="26-exercises">2.6 &nbsp; Exercises<a class="headerlink" href="#26-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="261-concept-review">2.6.1 &nbsp; Concept Review<a class="headerlink" href="#261-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-time-and-space-complexity-of-iteration-and-recursion">1. &nbsp; Time and Space Complexity of Iteration and Recursion<a class="headerlink" href="#1-time-and-space-complexity-of-iteration-and-recursion" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="36-exercises">3.6 &nbsp; Exercises<a class="headerlink" href="#36-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="361-concept-review">3.6.1 &nbsp; Concept Review<a class="headerlink" href="#361-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-data-relationships-in-everyday-situations">1. &nbsp; Data Relationships in Everyday Situations<a class="headerlink" href="#1-data-relationships-in-everyday-situations" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="126-exercises">12.6 &nbsp; Exercises<a class="headerlink" href="#126-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="1261-concept-review">12.6.1 &nbsp; Concept Review<a class="headerlink" href="#1261-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-which-tasks-are-suitable-for-divide-and-conquer">1. &nbsp; Which Tasks Are Suitable for Divide and Conquer?<a class="headerlink" href="#1-which-tasks-are-suitable-for-divide-and-conquer" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="148-exercises">14.8 &nbsp; Exercises<a class="headerlink" href="#148-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="1481-concept-review">14.8.1 &nbsp; Concept Review<a class="headerlink" href="#1481-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-when-is-dynamic-programming-appropriate">1. &nbsp; When Is Dynamic Programming Appropriate?<a class="headerlink" href="#1-when-is-dynamic-programming-appropriate" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="95-exercises">9.5 &nbsp; Exercises<a class="headerlink" href="#95-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="951-concept-review">9.5.1 &nbsp; Concept Review<a class="headerlink" href="#951-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-represent-the-same-graph-in-two-ways">1. &nbsp; Represent the Same Graph in Two Ways<a class="headerlink" href="#1-represent-the-same-graph-in-two-ways" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="156-exercises">15.6 &nbsp; Exercises<a class="headerlink" href="#156-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="1561-concept-review">15.6.1 &nbsp; Concept Review<a class="headerlink" href="#1561-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-is-choosing-the-largest-coin-always-best">1. &nbsp; Is Choosing the Largest Coin Always Best?<a class="headerlink" href="#1-is-choosing-the-largest-coin-always-best" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="65-exercises">6.5 &nbsp; Exercises<a class="headerlink" href="#65-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="651-concept-review">6.5.1 &nbsp; Concept Review<a class="headerlink" href="#651-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-searching-after-a-hash-collision">1. &nbsp; Searching After a Hash Collision<a class="headerlink" href="#1-searching-after-a-hash-collision" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="85-exercises">8.5 &nbsp; Exercises<a class="headerlink" href="#85-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="851-concept-review">8.5.1 &nbsp; Concept Review<a class="headerlink" href="#851-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-how-does-the-heap-change-after-inserting-10">1. &nbsp; How Does the Heap Change After Inserting 10?<a class="headerlink" href="#1-how-does-the-heap-change-after-inserting-10" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="107-exercises">10.7 &nbsp; Exercises<a class="headerlink" href="#107-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="1071-concept-review">10.7.1 &nbsp; Concept Review<a class="headerlink" href="#1071-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-how-binary-search-narrows-the-search-interval">1. &nbsp; How Binary Search Narrows the Search Interval<a class="headerlink" href="#1-how-binary-search-narrows-the-search-interval" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="1112-exercises">11.12 &nbsp; Exercises<a class="headerlink" href="#1112-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="11121-concept-review">11.12.1 &nbsp; Concept Review<a class="headerlink" href="#11121-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-the-first-few-rounds-of-selection-sort-and-bubble-sort">1. &nbsp; The First Few Rounds of Selection Sort and Bubble Sort<a class="headerlink" href="#1-the-first-few-rounds-of-selection-sort-and-bubble-sort" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="55-exercises">5.5 &nbsp; Exercises<a class="headerlink" href="#55-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="551-concept-review">5.5.1 &nbsp; Concept Review<a class="headerlink" href="#551-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-which-element-leaves-a-stack-or-queue-first">1. &nbsp; Which Element Leaves a Stack or Queue First?<a class="headerlink" href="#1-which-element-leaves-a-stack-or-queue-first" title="Permanent link">&para;</a></h3>
@@ -4932,8 +4932,6 @@


 <!-- Page content -->
-<!-- Generated by utils/exercises/publish_exercises.py; do not edit directly. -->
-
 <h1 id="77-exercises">7.7 &nbsp; Exercises<a class="headerlink" href="#77-exercises" title="Permanent link">&para;</a></h1>
 <h2 id="771-concept-review">7.7.1 &nbsp; Concept Review<a class="headerlink" href="#771-concept-review" title="Permanent link">&para;</a></h2>
 <h3 id="1-complete-full-and-perfect-binary-trees">1. &nbsp; Complete, Full, and Perfect Binary Trees<a class="headerlink" href="#1-complete-full-and-perfect-binary-trees" title="Permanent link">&para;</a></h3>
@@ -251,4 +251,4 @@
    initAutoSlide();
  }
 })();
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -8,4 +8,4 @@ document$.subscribe(({ body }) => {
    ],
  });
 });
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -15,4 +15,4 @@ window.MathJax = {
 document$.subscribe(() => {
  MathJax.typesetPromise();
 });
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -469,4 +469,4 @@

  return Starfield;
 });
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -176,4 +176,4 @@
    font-size: 0.7rem;
  }
 }
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -857,4 +857,4 @@ a:hover .device-on-hover {
    max-width: 100%;
  }
 }
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -122,4 +122,4 @@ main .gsc-loading-image {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -153,4 +153,4 @@ main {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031921 */
+/*! update cache: 20260719071706 */
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="46">4.6 &nbsp; 演習<a class="headerlink" href="#46" title="Permanent link">&para;</a></h1>
 <h2 id="461">4.6.1 &nbsp; 確認問題<a class="headerlink" href="#461" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 配列と連結リストが要素を見つける方法<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="136">13.6 &nbsp; 演習<a class="headerlink" href="#136" title="Permanent link">&para;</a></h1>
 <h2 id="1361">13.6.1 &nbsp; 確認問題<a class="headerlink" href="#1361" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; この順列アルゴリズムは結果を取りこぼすか<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="26">2.6 &nbsp; 演習<a class="headerlink" href="#26" title="Permanent link">&para;</a></h1>
 <h2 id="261">2.6.1 &nbsp; 確認問題<a class="headerlink" href="#261" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 反復と再帰の時間・空間計算量<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="36">3.6 &nbsp; 演習<a class="headerlink" href="#36" title="Permanent link">&para;</a></h1>
 <h2 id="361">3.6.1 &nbsp; 確認問題<a class="headerlink" href="#361" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 身近な場面にあるデータの関係<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="126">12.6 &nbsp; 演習<a class="headerlink" href="#126" title="Permanent link">&para;</a></h1>
 <h2 id="1261">12.6.1 &nbsp; 確認問題<a class="headerlink" href="#1261" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 分割統治に適した処理<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="148">14.8 &nbsp; 演習<a class="headerlink" href="#148" title="Permanent link">&para;</a></h1>
 <h2 id="1481">14.8.1 &nbsp; 確認問題<a class="headerlink" href="#1481" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 動的計画法が適している場面<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="95">9.5 &nbsp; 演習<a class="headerlink" href="#95" title="Permanent link">&para;</a></h1>
 <h2 id="951">9.5.1 &nbsp; 確認問題<a class="headerlink" href="#951" title="Permanent link">&para;</a></h2>
 <h3 id="1-2">1. &nbsp; 同じグラフを 2 つの方法で表す<a class="headerlink" href="#1-2" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="156">15.6 &nbsp; 演習<a class="headerlink" href="#156" title="Permanent link">&para;</a></h1>
 <h2 id="1561">15.6.1 &nbsp; 確認問題<a class="headerlink" href="#1561" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 毎回最大の硬貨を選べば必ず最善か<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="65">6.5 &nbsp; 演習<a class="headerlink" href="#65" title="Permanent link">&para;</a></h1>
 <h2 id="651">6.5.1 &nbsp; 確認問題<a class="headerlink" href="#651" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; ハッシュ衝突後の探索方法<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="85">8.5 &nbsp; 演習<a class="headerlink" href="#85" title="Permanent link">&para;</a></h1>
 <h2 id="851">8.5.1 &nbsp; 確認問題<a class="headerlink" href="#851" title="Permanent link">&para;</a></h2>
 <h3 id="1-10">1. &nbsp; 10 をヒープへ追加した後の調整<a class="headerlink" href="#1-10" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="107">10.7 &nbsp; 演習<a class="headerlink" href="#107" title="Permanent link">&para;</a></h1>
 <h2 id="1071">10.7.1 &nbsp; 確認問題<a class="headerlink" href="#1071" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 二分探索で探索区間を狭める方法<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="1112">11.12 &nbsp; 演習<a class="headerlink" href="#1112" title="Permanent link">&para;</a></h1>
 <h2 id="11121">11.12.1 &nbsp; 確認問題<a class="headerlink" href="#11121" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 選択ソートとバブルソートの最初の数回<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="55">5.5 &nbsp; 演習<a class="headerlink" href="#55" title="Permanent link">&para;</a></h1>
 <h2 id="551">5.5.1 &nbsp; 確認問題<a class="headerlink" href="#551" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; スタックとキューではどれが先に取り出されるか<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4932,8 +4932,6 @@


 <!-- Page content -->
-<!-- utils/exercises/publish_exercises.py により自動生成されています。直接編集しないでください。 -->
-
 <h1 id="77">7.7 &nbsp; 演習<a class="headerlink" href="#77" title="Permanent link">&para;</a></h1>
 <h2 id="771">7.7.1 &nbsp; 確認問題<a class="headerlink" href="#771" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; 完全二分木・充満二分木・充足二分木<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -251,4 +251,4 @@
    initAutoSlide();
  }
 })();
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -8,4 +8,4 @@ document$.subscribe(({ body }) => {
    ],
  });
 });
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -15,4 +15,4 @@ window.MathJax = {
 document$.subscribe(() => {
  MathJax.typesetPromise();
 });
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -469,4 +469,4 @@

  return Starfield;
 });
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -176,4 +176,4 @@
    font-size: 0.7rem;
  }
 }
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -857,4 +857,4 @@ a:hover .device-on-hover {
    max-width: 100%;
  }
 }
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -122,4 +122,4 @@ main .gsc-loading-image {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -153,4 +153,4 @@ main {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031925 */
+/*! update cache: 20260719071716 */
@@ -251,4 +251,4 @@
    initAutoSlide();
  }
 })();
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -8,4 +8,4 @@ document$.subscribe(({ body }) => {
    ],
  });
 });
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -15,4 +15,4 @@ window.MathJax = {
 document$.subscribe(() => {
  MathJax.typesetPromise();
 });
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -469,4 +469,4 @@

  return Starfield;
 });
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="46">4.6 &nbsp; Упражнения<a class="headerlink" href="#46" title="Permanent link">&para;</a></h1>
 <h2 id="461">4.6.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#461" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Как массив и связный список находят элемент<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="136">13.6 &nbsp; Упражнения<a class="headerlink" href="#136" title="Permanent link">&para;</a></h1>
 <h2 id="1361">13.6.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#1361" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Пропустит ли этот алгоритм некоторые перестановки<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="26">2.6 &nbsp; Упражнения<a class="headerlink" href="#26" title="Permanent link">&para;</a></h1>
 <h2 id="261">2.6.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#261" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Временная и пространственная сложность итерации и рекурсии<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="36">3.6 &nbsp; Упражнения<a class="headerlink" href="#36" title="Permanent link">&para;</a></h1>
 <h2 id="361">3.6.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#361" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Связи между данными в повседневных ситуациях<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="126">12.6 &nbsp; Упражнения<a class="headerlink" href="#126" title="Permanent link">&para;</a></h1>
 <h2 id="1261">12.6.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#1261" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Какие задачи подходят для метода «разделяй и властвуй»<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="148">14.8 &nbsp; Упражнения<a class="headerlink" href="#148" title="Permanent link">&para;</a></h1>
 <h2 id="1481">14.8.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#1481" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Когда подходит динамическое программирование<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="95">9.5 &nbsp; Упражнения<a class="headerlink" href="#95" title="Permanent link">&para;</a></h1>
 <h2 id="951">9.5.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#951" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Два представления одного графа<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="156">15.6 &nbsp; Упражнения<a class="headerlink" href="#156" title="Permanent link">&para;</a></h1>
 <h2 id="1561">15.6.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#1561" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Всегда ли лучше брать самую крупную монету<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="65">6.5 &nbsp; Упражнения<a class="headerlink" href="#65" title="Permanent link">&para;</a></h1>
 <h2 id="651">6.5.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#651" title="Permanent link">&para;</a></h2>
 <h3 id="1-">1. &nbsp; Как искать после хеш-коллизии<a class="headerlink" href="#1-" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="85">8.5 &nbsp; Упражнения<a class="headerlink" href="#85" title="Permanent link">&para;</a></h1>
 <h2 id="851">8.5.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#851" title="Permanent link">&para;</a></h2>
 <h3 id="1-10">1. &nbsp; Как перестраивается куча после добавления числа 10<a class="headerlink" href="#1-10" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="107">10.7 &nbsp; Упражнения<a class="headerlink" href="#107" title="Permanent link">&para;</a></h1>
 <h2 id="1071">10.7.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#1071" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Как двоичный поиск сужает область поиска<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4910,8 +4910,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="1112">11.12 &nbsp; Упражнения<a class="headerlink" href="#1112" title="Permanent link">&para;</a></h1>
 <h2 id="11121">11.12.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#11121" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Первые итерации сортировки выбором и пузырьком<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4888,8 +4888,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="55">5.5 &nbsp; Упражнения<a class="headerlink" href="#55" title="Permanent link">&para;</a></h1>
 <h2 id="551">5.5.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#551" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Что первым извлекается из стека и очереди<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -4932,8 +4932,6 @@


 <!-- Page content -->
-<!-- Автоматически создано utils/exercises/publish_exercises.py; не редактируйте напрямую. -->
-
 <h1 id="77">7.7 &nbsp; Упражнения<a class="headerlink" href="#77" title="Permanent link">&para;</a></h1>
 <h2 id="771">7.7.1 &nbsp; Вопросы для самопроверки<a class="headerlink" href="#771" title="Permanent link">&para;</a></h2>
 <h3 id="1">1. &nbsp; Полные, строгие и идеальные двоичные деревья<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -251,4 +251,4 @@
    initAutoSlide();
  }
 })();
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -8,4 +8,4 @@ document$.subscribe(({ body }) => {
    ],
  });
 });
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -15,4 +15,4 @@ window.MathJax = {
 document$.subscribe(() => {
  MathJax.typesetPromise();
 });
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -469,4 +469,4 @@

  return Starfield;
 });
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -176,4 +176,4 @@
    font-size: 0.7rem;
  }
 }
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -857,4 +857,4 @@ a:hover .device-on-hover {
    max-width: 100%;
  }
 }
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -122,4 +122,4 @@ main .gsc-loading-image {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -153,4 +153,4 @@ main {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031930 */
+/*! update cache: 20260719071726 */
@@ -176,4 +176,4 @@
    font-size: 0.7rem;
  }
 }
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -857,4 +857,4 @@ a:hover .device-on-hover {
    max-width: 100%;
  }
 }
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -122,4 +122,4 @@ main .gsc-loading-image {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -153,4 +153,4 @@ main {
 .gsc-reply-content::-webkit-scrollbar-track {
  background: transparent;
 }
-/*! update cache: 20260719031913 */
+/*! update cache: 20260719071648 */
@@ -1373,14 +1373,6 @@
  </span>
  
  
-    
-  
-  
-    <span class="md-status md-status--new" title="最近新增">
-    </span>
-  
-
-  

      </a>
    </li>
@@ -1380,14 +1380,6 @@
  </span>
  
  
-    
-  
-  
-    <span class="md-status md-status--new" title="最近新增">
-    </span>
-  
-
-  

      </a>
    </li>
@@ -1380,14 +1380,6 @@
  </span>
  
  
-    
-  
-  
-    <span class="md-status md-status--new" title="最近新增">
-    </span>
-  
-
-  

      </a>
    </li>
--- a/Show More
+++ b/Show More