<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Heapq on 每日拍拍</title>
    <link>https://dailypypy.org/tags/heapq/</link>
    <description>Recent content in Heapq on 每日拍拍</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-tw</language>
    <copyright>© 2026 每日拍拍</copyright>
    <lastBuildDate>Wed, 09 Sep 2026 12:44:00 +0800</lastBuildDate><atom:link href="https://dailypypy.org/tags/heapq/index.xml" rel="self" type="application/rss+xml" />
    <follow_challenge>
      <feedId>155076163427069952</feedId>
      <userId>154825760438254592</userId>
    </follow_challenge>
    
    
    <item>
      <title>Python heapq 實戰：優先佇列、Top-K 與任務排序</title>
      <link>https://dailypypy.org/learn/python-heapq/</link>
      <pubDate>Wed, 09 Sep 2026 12:44:00 +0800</pubDate>
      
      <guid>https://dailypypy.org/learn/python-heapq/</guid>
      <description>&lt;!---
1440x768
prompt: masterpiece, best quality, highres, clean anime illustration, japanese anime style, soft shading, flat color design, 1girl, black hair, green eyes, white off-shoulder shirt, black short skirt, from above, full body, sitting on the floor with knees to one side, one hand pointing toward floating blank stacked blocks, cheerful focused smile, looking at viewer, pastel pistachio green background, subtle floating translucent stacked blocks and curved ordering arrows without symbols or text, neat composition, detailed eyes, cute and smart vibe, minimal background, polished illustration, no text
negative prompt: worst quality, bad eye, bad hand, extra limbs, manga, multiple views, monochrome, text, signature
dedup note: 2026-09-09 approved rescue of the exact planned python-heapq draft. A strict 157-post inventory and current-source scan found only incidental top-k wording in two RAG posts and a one-row heapq comparison in rust-collections. Nearby ../python-collections/ covers deque and Counter, ../python-apscheduler/ covers time-based job scheduling, and ../python-graphlib/ covers dependency-aware topological ordering. This article is distinct because it focuses on heap invariants, priority queues, Top-K selection, lazy deletion, stable tie-breaking, and Python 3.14 max-heap APIs.
---&gt;
&lt;p&gt;





&lt;figure&gt;
    &lt;img class=&#34;my-0 rounded-md&#34; loading=&#34;lazy&#34; alt=&#34;featured&#34; src=&#34;./featured.png&#34; /&gt;

  
&lt;/figure&gt;
&lt;/p&gt;</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://dailypypy.org/learn/python-heapq/featured.png" />
    </item>
    
  </channel>
</rss>
