Python:使用Max-Heap和Min-Heap查找运行中位数

import heapq

max_heap = []  # Max-Heap，存储较小的一半元素
min_heap = []  # Min-Heap，存储较大的一半元素

def insert(num):
    if len(max_heap) == len(min_heap):
        heapq.heappush(max_heap, -num)  # 将元素的相反数插入Max-Heap
        heapq.heappush(min_heap, -heapq.heappop(max_heap))  # 将Max-Heap的最大元素插入Min-Heap
    else:
        heapq.heappush(min_heap, num)  # 将元素插入Min-Heap
        heapq.heappush(max_heap, -heapq.heappop(min_heap))  # 将Min-Heap的最小元素插入Max-Heap

def get_median():
    if len(max_heap) == len(min_heap):
        return (-max_heap[0] + min_heap[0]) / 2  # 如果元素总数为偶数，取两个堆顶元素的平均值
    else:
        return min_heap[0]  # 如果元素总数为奇数，取Min-Heap的堆顶元素

insert(5)
insert(10)
insert(2)
median = get_median()
print(median)  # 输出：5.0