algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-31 06:13:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-02-28 20:02:48 +08:00
parent 3f5140e815
commit a436f145a1
90 changed files with 753 additions and 4433 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
chapter_heap/heap/index.html
View File

@ -25,7 +25,7 @@
<title>8.1.   堆（Heap） - Hello 算法</title>
<title>8.1.   堆 - Hello 算法</title>
@ -79,7 +79,7 @@
<div data-md-component="skip">
<a href="#81-heap" class="md-skip">
<a href="#81" class="md-skip">
跳转至
</a>
@ -111,7 +111,7 @@
<div class="md-header__topic" data-md-component="header-topic">
<span class="md-ellipsis">
8.1. &nbsp; 堆（Heap）
8.1. &nbsp; 堆
</span>
</div>
@ -650,7 +650,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/array/" class="md-nav__link">
4.1. &nbsp; 数组（Array）
4.1. &nbsp; 数组
</a>
</li>
@ -664,7 +664,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/linked_list/" class="md-nav__link">
4.2. &nbsp; 链表（Linked List）
4.2. &nbsp; 链表
</a>
</li>
@ -678,7 +678,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/list/" class="md-nav__link">
4.3. &nbsp; 列表（List）
4.3. &nbsp; 列表
</a>
</li>
@ -753,7 +753,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/stack/" class="md-nav__link">
5.1. &nbsp; 栈（Stack）
5.1. &nbsp; 栈
</a>
</li>
@ -767,7 +767,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/queue/" class="md-nav__link">
5.2. &nbsp; 队列（Queue）
5.2. &nbsp; 队列
</a>
</li>
@ -781,7 +781,7 @@
<li class="md-nav__item">
<a href="../../chapter_stack_and_queue/deque/" class="md-nav__link">
5.3. &nbsp; 双向队列（Deque）
5.3. &nbsp; 双向队列
</a>
</li>
@ -854,7 +854,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/hash_map/" class="md-nav__link">
6.1. &nbsp; 哈希表（Hash Map）
6.1. &nbsp; 哈希表
</a>
</li>
@ -927,14 +927,14 @@
<label class="md-nav__link" for="__nav_8" id="__nav_8_label" tabindex="0">
7. &nbsp; &nbsp; 二叉树
7. &nbsp; &nbsp; 树
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_8_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_8">
<span class="md-nav__icon md-icon"></span>
7. &nbsp; &nbsp; 二叉树
7. &nbsp; &nbsp; 树
</label>
<ul class="md-nav__list" data-md-scrollfix>
@ -945,7 +945,7 @@
<li class="md-nav__item">
<a href="../../chapter_tree/binary_tree/" class="md-nav__link">
7.1. &nbsp; 二叉树（Binary Tree）
7.1. &nbsp; 二叉树
</a>
</li>
@ -1071,12 +1071,12 @@
<label class="md-nav__link md-nav__link--active" for="__toc">
8.1. &nbsp; 堆（Heap）
8.1. &nbsp; 堆
<span class="md-nav__icon md-icon"></span>
</label>
<a href="./" class="md-nav__link md-nav__link--active">
8.1. &nbsp; 堆（Heap）
8.1. &nbsp; 堆
</a>
@ -1247,7 +1247,7 @@
<li class="md-nav__item">
<a href="../../chapter_graph/graph/" class="md-nav__link">
9.1. &nbsp; 图（Graph）
9.1. &nbsp; 图
</a>
</li>
@ -1770,7 +1770,7 @@
<h1 id="81-heap">8.1. &nbsp; 堆（Heap）<a class="headerlink" href="#81-heap" title="Permanent link">&para;</a></h1>
<h1 id="81">8.1. &nbsp; 堆<a class="headerlink" href="#81" title="Permanent link">&para;</a></h1>
<p>「堆 Heap」是一棵限定条件下的「完全二叉树」。根据成立条件，堆主要分为两种类型：</p>
<ul>
<li>「大顶堆 Max Heap」，任意结点的值 <span class="arithmatex">\(\geq\)</span> 其子结点的值；</li>