xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-11 11:20:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-27 23:41:10 +08:00
parent 8c9cf3f087
commit 016f13d882
66 changed files with 262 additions and 270 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_heap/summary/index.html
+1 -1
View File
@@ -3431,7 +3431,7 @@
<ul>
<li>堆是一棵完全二叉树，根据成立条件可分为大顶堆和小顶堆。大（小）顶堆的堆顶元素是最大（小）的。</li>
<li>优先队列的定义是具有出队优先级的队列，通常使用堆来实现。</li>
<li>堆的常用操作及其对应的时间复杂度包括：元素入堆 <span class="arithmatex">\(O(\log n)\)</span> 、堆顶元素出堆 <span class="arithmatex">\(O(\log n)\)</span> 和访问堆顶元素 <span class="arithmatex">\(O(1)\)</span> 等。</li>
<li>堆的常用操作及其对应的时间复杂度包括：元素入堆 <span class="arithmatex">\(O(\log n)\)</span>、堆顶元素出堆 <span class="arithmatex">\(O(\log n)\)</span> 和访问堆顶元素 <span class="arithmatex">\(O(1)\)</span> 等。</li>
<li>完全二叉树非常适合用数组表示，因此我们通常使用数组来存储堆。</li>
<li>堆化操作用于维护堆的性质，在入堆和出堆操作中都会用到。</li>
<li>输入 <span class="arithmatex">\(n\)</span> 个元素并建堆的时间复杂度可以优化至 <span class="arithmatex">\(O(n)\)</span> ，非常高效。</li>