[Leetcode] #295 Find Median from Data Stream (Heap)

Discription:

Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.

Examples: 

[2,3,4] , the median is 3

[2,3], the median is (2 + 3) / 2 = 2.5

Design a data structure that supports the following two operations:

• void addNum(int num) - Add a integer number from the data stream to the data structure.
• double findMedian() - Return the median of all elements so far.

For example:

addNum(1)addNum(2)findMedian() -> 1.5addNum(3) findMedian() -> 2

Solution:

class MedianFinder {priority_queue<long> maxHeap, minHeap;  public:void addNum(int num) {maxHeap.push(num);minHeap.push(-maxHeap.top());maxHeap.pop();if (maxHeap.size() < minHeap.size()) {maxHeap.push(-minHeap.top());minHeap.pop();}}double findMedian() {if (maxHeap.size() > minHeap.size())return maxHeap.top();else    return (maxHeap.top() - minHeap.top()) / 2.0;}};