Find Median from Data Stream

题目链接

原题

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

思路

建立一个最小堆和最大堆, 
最小堆维护均值以后的, 最大堆维护均值之前的. 
(这里假设数组是按升序排序的)
当插入数据时, 需要考虑插入到哪个堆里面, 然后再考虑两个堆的大小关系.

code

class MedianFinder {
public:

    // Adds a number into the data structure.
    void addNum(int num) {
        if(maxH_.empty() || num < maxH_.top()) {
            maxH_.push(num);
            if(maxH_.size() > minH_.size() + 1) {
                minH_.push(maxH_.top());
                maxH_.pop();
            }
        } else {
            minH_.push(num);
            if(minH_.size() > maxH_.size() + 1) {
                maxH_.push(minH_.top());
                minH_.pop();
            }
        }
    }

    // Returns the median of current data stream
    double findMedian() {
        int l1 = minH_.size();
        int l2 = maxH_.size();
        if(l1 > l2) return minH_.top();
        if(l1 < l2) return maxH_.top();
        return (minH_.top() + maxH_.top()) / 2.0;
    }

private:
    // min_heap_ stores the larger half seen so far.
    priority_queue<int, vector<int>, greater<int>> minH_;
    // max_heap_ stores the smaller half seen so far.
    priority_queue<int, vector<int>, less<int>> maxH_;
};

// Your MedianFinder object will be instantiated and called as such:
// MedianFinder mf;
// mf.addNum(1);
// mf.findMedian();