295. 数据流的中位数

题目描述

点这里

思路分析

堆的经典变形——对顶堆：动态维护中位数

代码实现

class MedianFinder {
public:
    priority_queue<int,vector<int>,greater<int>> down;
    priority_queue<int,vector<int>,less<int>> up;
    MedianFinder() {

    }
    
    void addNum(int num) {
        if(down.empty()||num>down.top()){
             down.push(num);
             if(down.size()>up.size()+1) {
                 up.push(down.top());
                 down.pop();
             }
        }
        else{
            up.push(num);
            if(up.size()>down.size()){
                down.push(up.top());
                up.pop();
            }
        }
    }
    
    double findMedian() {
        if(down.size()>up.size()) return down.top();
        else return (down.top()+up.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();
 */