295. Find Median from Data Stream

Problem

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:

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

Credits:
Special thanks to @Louis1992 for adding this problem and creating all test cases.

Solution

左边是maxHeap, 右边是minHeap   

加数字进来时 需要保证1. 左边的最大值 小于 右边的最小值   2. 左右两个堆的数量持平

class MedianFinder {
    priority_queue<int, vector<int>, std::greater<int>> minHeap;
    priority_queue<int, vector<int>, std::less<int>> maxHeap;
    // Adds a number into the data structure.
    void rebalance() {
        int maxTop = maxHeap.top(), minTop = minHeap.top();
        if(maxTop > minTop){
            maxHeap.pop();
            minHeap.pop();
            maxHeap.push(minTop);
            minHeap.push(maxTop);
        }
    }
public:
    void addNum(int num) {
        if( minHeap.empty()) { minHeap.push(num); return;}
        
        int maxSize = maxHeap.size(), minSize = minHeap.size();
        int minTop = minHeap.top();
        if( maxSize == minSize ) {
            num > minTop ? minHeap.push(num) :
            maxHeap.push(num);
        }
        else {
            maxSize < minSize ? maxHeap.push(num) :
            minHeap.push(num);
            
            rebalance();
        }
    }
    
    // Returns the median of current data stream
    double findMedian() {
        int maxSize = maxHeap.size(), minSize = minHeap.size();
        int minTop = minHeap.top();
        if( maxSize > minSize ){
            return maxHeap.top();
        }
        else if ( maxSize < minSize){
            return minTop;
        }
        else {
            return (maxHeap.top() + minTop)/2.0;
        }
    }
};