295. Find Median from Data Stream

解題說明

C++ 解法

複雜度分析

虛擬碼

addNum(num):
1. Push num to maxHeap
2. Push maxHeap.top() to minHeap, pop from maxHeap
3. If minHeap.size() > maxHeap.size():
   push minHeap.top() to maxHeap, pop from minHeap

findMedian():
1. If sizes equal: return (maxHeap.top + minHeap.top) / 2.0
2. Else: return maxHeap.top (larger heap holds median)

其他解法

延伸思考