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 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。