DSA 部分簡單

優先隊列

「優先權佇列」問題的詳細指南和 Python 實作。

問題陳述

簡單

寫一個函數 execute_priority_queue(operations) 來模擬最小優先權佇列。輸入是 operations 形式的元組列表 ("insert", val)("extract_min",)。傳回提取的最小值的列表。

約束條件
  • 0 <= len(operations) <= 1000

範例

Example 1
Input
operations = [("insert", 5), ("insert", 2), ("insert", 8), ("extract_min",), ("extract_min",)]
Output
[2, 5]
Explanation

Insert 5, 2, 8. First extract returns 2. Second extract returns 5.

Need a Hint?
考慮使用佇列特定的資料結構,例如集合或堆。
Edge Cases to Watch
  • 空輸入結構
  • 單元素輸入
  • 大數值範圍

準備好解決了嗎?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在編輯器中開啟
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推薦的 Python 資源

透過相關的互動式教學、備忘單和程式碼比較來擴展您的知識。