295. Find Median from Data Stream

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

• For example, for arr = [2,3,4], the median is 3.
• For example, for arr = [2,3], the median is (2 + 3) / 2 = 2.5.

Implement the MedianFinder class:

• MedianFinder() initializes the MedianFinder object.
• void addNum(int num) adds the integer num from the data stream to the data structure.
• double findMedian() returns the median of all elements so far. Answers within 10-5 of the actual answer will be accepted.

Example 1:

Input
["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"]
[[], [1], [2], [], [3], []]
Output
[null, null, null, 1.5, null, 2.0]

Explanation
MedianFinder medianFinder = new MedianFinder();
medianFinder.addNum(1);    // arr = [1]
medianFinder.addNum(2);    // arr = [1, 2]
medianFinder.findMedian(); // return 1.5 (i.e., (1 + 2) / 2)
medianFinder.addNum(3);    // arr[1, 2, 3]
medianFinder.findMedian(); // return 2.0

Constraints:

• -105 <= num <= 105
• There will be at least one element in the data structure before calling findMedian.
• At most 5 * 104 calls will be made to addNum and findMedian.

题目：找数据流的中位数。

思路：维护一个大顶堆，一个小顶堆，大顶堆保存数值小的一半数据流，小顶堆保存数值大的一半数据流。每加入一个新元素比较两个堆顶确定放在哪个堆里。如果两个堆长度相差2以上则平衡一下。每次取值时取堆顶数据即是中位数

代码：

class MedianFinder {
private:
    priority_queue<int, vector<int>, greater<int>> maxQ;
    priority_queue<int, vector<int>, less<int>> minQ;
public:
    MedianFinder() {
        
    }
    
    void addNum(int num) {
        if(minQ.empty() || num <= minQ.top()) minQ.push(num);
        else maxQ.push(num);
        
        if(minQ.size() > maxQ.size()+1){
            maxQ.push(minQ.top());
            minQ.pop();
        }
        if(maxQ.size() > minQ.size()+1){
            minQ.push(maxQ.top());
            maxQ.pop();
        }
    }
    
    double findMedian() {
        if(minQ.size() > maxQ.size()) return minQ.top();
        else if(minQ.size() < maxQ.size()) return maxQ.top();
        else return (double(minQ.top()) + double(maxQ.top())) / 2.0;
    }
};

/**
 * Your MedianFinder object will be instantiated and called as such:
 * MedianFinder* obj = new MedianFinder();
 * obj->addNum(num);
 * double param_2 = obj->findMedian();
 */