This commit is contained in:
krahets
2023-06-12 23:05:10 +08:00
parent fc1707df0b
commit 6eabe4597f
91 changed files with 3965 additions and 249 deletions

View File

@ -15,7 +15,7 @@
<link rel="canonical" href="https://www.hello-algo.com/chapter_heap/summary/">
<link rel="prev" href="../build_heap/">
<link rel="prev" href="../top_k/">
<link rel="next" href="../../chapter_graph/">
@ -25,7 +25,7 @@
<title>8.3.   小结 - Hello 算法</title>
<title>8.4.   小结 - Hello 算法</title>
@ -79,7 +79,7 @@
<div data-md-component="skip">
<a href="#83" class="md-skip">
<a href="#84" class="md-skip">
跳转至
</a>
@ -113,7 +113,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
8.3. &nbsp; 小结
8.4. &nbsp; 小结
</span>
</div>
@ -1197,6 +1197,8 @@
@ -1240,7 +1242,21 @@
<li class="md-nav__item">
<a href="../build_heap/" class="md-nav__link">
8.2. &nbsp; 建堆操作 *
8.2. &nbsp; 建堆操作
</a>
</li>
<li class="md-nav__item">
<a href="../top_k/" class="md-nav__link">
8.3. &nbsp; Top-K 问题
</a>
</li>
@ -1263,7 +1279,7 @@
<a href="./" class="md-nav__link md-nav__link--active">
8.3. &nbsp; 小结
8.4. &nbsp; 小结
</a>
</li>
@ -2008,7 +2024,7 @@
<h1 id="83">8.3. &nbsp; 小结<a class="headerlink" href="#83" title="Permanent link">&para;</a></h1>
<h1 id="84">8.4. &nbsp; 小结<a class="headerlink" href="#84" title="Permanent link">&para;</a></h1>
<ul>
<li>堆是一棵完全二叉树,根据成立条件可分为大顶堆和小顶堆。大(小)顶堆的堆顶元素是最大(小)的。</li>
<li>优先队列的定义是具有出队优先级的队列,通常使用堆来实现。</li>
@ -2094,7 +2110,7 @@
<nav class="md-footer__inner md-grid" aria-label="页脚" >
<a href="../build_heap/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 8.2. &amp;nbsp; 建堆操作 *" rel="prev">
<a href="../top_k/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 8.3. &amp;nbsp; Top-K 问题" rel="prev">
<div class="md-footer__button md-icon">
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
</div>
@ -2103,7 +2119,7 @@
上一页
</span>
<div class="md-ellipsis">
8.2. &nbsp; 建堆操作 *
8.3. &nbsp; Top-K 问题
</div>
</div>
</a>