思路:这题是求在动态插入数字的时候求数列的中位数,利用对顶堆(一个大根堆,一个小根堆)来维护数列,但要确保两个堆
动态平衡(大,小根堆的size之差不能超过2)
题目链接:https://leetcode-cn.com/problems/find-median-from-data-stream/submissions/
题解代码:
class MedianFinder {
public:
/** initialize your data structure here. */
priority_queue <int> q1;
priority_queue <int, vector<int>, greater<int> > q2;
MedianFinder() {
}
void addNum(int num) {
if (q1.empty()) {
q1.push(num);
return ;
}
if (num > q1.top()) {
q2.push(num);
}
else {
q1.push(num);
}
if ((q1.size() - q2.size()) == 2) {
q2.push(q1.top());
q1.pop();
return ;
}
else if ((q2.size() - q1.size()) == 2) {
q1.push(q2.top());
q2.pop();
return ;
}
}
double findMedian() {
if (q1.size() == q2.size()) {
return (double)(q1.top() + q2.top()) / 2.0;
}
else {
if (q1.size() > q2.size()) {
return (double)q1.top();
}
else {
return (double)q2.top();
}
}
}
};
/**
* Your MedianFinder object will be instantiated and called as such:
* MedianFinder* obj = new MedianFinder();
* obj->addNum(num);
* double param_2 = obj->findMedian();
*/