题目
Leetcode 295. 数据流的中位数
代码(首刷看解析)
class MedianFinder {
public:
priority_queue<int> q_max;
priority_queue<int, vector<int>, greater<int>> q_min;
MedianFinder() {
}
void addNum(int num) {
if(q_min.size() >= q_max.size()) {
q_max.push(num);
q_max.push(q_min.top());
q_min.pop();
} else {
q_min.push(num);
q_min.push(q_max.top());
q_max.pop();
}
}
double findMedian() {
if(q_min.size() < q_max.size()) {
return q_max.top();
} else if(q_min.size() > q_max.size()) {
return q_min.top();
} else {
return (q_min.top() + q_max.top()) / 2.0;
}
}
};
代码(8.22 二刷看解析)
BM48 数据流中的中位数
- 首先需要保证两个堆数量高度平衡
- 保证大顶堆的都比小顶堆的小,所以需要进行堆顶交换push.
#include <functional>
#include <queue>
class Solution {
public:
void Insert(int num) {
if(minQ.size() == maxQ.size()) {
minQ.push(num);
maxQ.push(minQ.top());
minQ.pop();
} else {
maxQ.push(num);
minQ.push(maxQ.top());
maxQ.pop();
}
}
double GetMedian() {
if((minQ.size()+maxQ.size())%2==1)
return maxQ.top();
return (maxQ.top()+minQ.top())/2.0;
}
priority_queue<int> maxQ;
priority_queue<int, vector<int>, greater<int>> minQ;
};
代码(9.13 三刷自解)
class MedianFinder {
public:
priority_queue<int> maxQ;
priority_queue<int,vector<int>, greater<int>> minQ;
MedianFinder() {}
void addNum(int num) {
if(maxQ.size() <= minQ.size()) {
minQ.push(num);
maxQ.push(minQ.top());
minQ.pop();
} else {
maxQ.push(num);
minQ.push(maxQ.top());
maxQ.pop();
}
}
double findMedian() {
if((maxQ.size()+minQ.size())%2==1)
return maxQ.top();
return (maxQ.top()+minQ.top())/2.0;
}
};
代码(9.20 四刷自解)
class MedianFinder {
public:
priority_queue<int> maxQ;
priority_queue<int, vector<int>, greater<int>> minQ;
MedianFinder() {}
void addNum(int num) {
if(maxQ.size() >= minQ.size()) {
maxQ.push(num);
minQ.push(maxQ.top());
maxQ.pop();
} else {
minQ.push(num);
maxQ.push(minQ.top());
minQ.pop();
}
}
double findMedian() {
if((maxQ.size()+minQ.size())%2) {
return minQ.top();
} else {
return (maxQ.top()+minQ.top())/2.0;
}
}
};