Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
Examples: [2,3,4]
, the median is 3
[2,3]
, the median is (2 + 3) / 2 = 2.5
Design a data structure that supports the following two operations:
- void addNum(int num) - Add a integer number from the data stream to the data structure.
- double findMedian() - Return the median of all elements so far.
For example:
add(1) add(2) findMedian() -> 1.5 add(3) findMedian() -> 2
这道题的关键是,维护两个堆,一个用来存小的一半的数,一个用来存大的一半的数。当取median的时候,如果两个数量一样,那么我们直接去小的里面最大和大的里面最小,进行求和除以2即可。如果有一个堆的数量多,那么就去多的那个堆的最顶上的。
关键是,插入的时候如何维护平衡。大概分为几步,
1.每次都先往小一半儿的堆里面插入,然后取里面的最大的,放入一多半儿里面去。
2. 为了保持一半的平衡,所以当小一半堆与大一半堆的数量之差达到2的时候,就要从大堆里面移一个到小堆里
3. 关于priority_queue的用法,可以看上一篇博客
代码如下:
class MedianFinder {
private:
priority_queue<int,vector<int>,less<int>> maxheap;
priority_queue<int,vector<int>,greater<int>> minheap;
public:
// Adds a number into the data structure.
void addNum(int num) {
maxheap.push(num);
int tmp = maxheap.top();
maxheap.pop();
minheap.push(tmp);
if (maxheap.size() + 1 < minheap.size()) {
maxheap.push(minheap.top());
minheap.pop();
}
}
// Returns the median of current data stream
double findMedian() {
if (maxheap.size() > minheap.size())
return maxheap.top();
else if (maxheap.size() < minheap.size())
return minheap.top();
else
return (maxheap.top()+minheap.top())/2.0;
}
};