https://mem.leabol.top/tags/%E5%A0%86/ Recent content in 堆 on memory Hugo zh-cn Thu, 11 Jun 2026 00:00:00 +0000 https://mem.leabol.top/posts/dsa/heap_core_algorithm/ Thu, 11 Jun 2026 00:00:00 +0000 https://mem.leabol.top/posts/dsa/heap_core_algorithm/ <h1 id="堆的核心算法解析">堆的核心算法解析</h1> <h2 id="核心要点">核心要点</h2> <p>这个精简版堆只保留了<strong>最核心的两个算法</strong>：</p> <h3 id="节点索引计算公式堆的基础">节点索引计算公式（堆的基础）</h3> <div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;"><code class="language-txt" data-lang="txt"><span style="display:flex;"><span>父节点索引 = (当前索引 - 1) / 2 </span></span><span style="display:flex;"><span>左子节点索引 = 当前索引 * 2 + 1 </span></span><span style="display:flex;"><span>右子节点索引 = 当前索引 * 2 + 2 </span></span></code></pre></div><h3 id="核心算法1-上浮调整-heapifyup">核心算法1: 上浮调整 (heapifyUp)</h3> <p><strong>用途</strong>: 插入新元素后维护堆性质 <strong>原理</strong>: 新元素从末尾开始，与父节点比较，如果优先级更高就向上交换</p>