LeetCode 295. 数据流的中位数

295. 数据流的中位数

class MedianFinder {
public:
    priority_queue<int, vector<int>, less<int> > down; //下边的大根堆
    priority_queue<int, vector<int>, greater<int> > up; //上面的小根堆

    MedianFinder() {

    }
    
    void addNum(int num) {
        if(down.empty() || num <= down.top()) down.push(num); //如果下面为空，或者小于堆顶
        else up.push(num); //插入上面的堆
        if(down.size() > up.size() + 1) up.push(down.top()), down.pop(); //下面元素太多
        if(up.size() > down.size()) down.push(up.top()), up.pop();//上面元素过多
    }
    
    double findMedian() {
        if(up.size() == down.size()) return (up.top() + down.top()) / 2.0; //偶数个
        else return down.top(); //奇数个
    }
};

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