[Leetcode] #295 Find Median from Data Stream (Heap)

Discription

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:

addNum(1)
addNum(2)
findMedian() -> 1.5
addNum(3) 
findMedian() -> 2

Solution

class MedianFinder {
public:
	int count = 0;
	priority_queue<int> maxheap;
	priority_queue<int, vector<int>, greater<int>> minheap;

	/** initialize your data structure here. */
	MedianFinder() {
	}

	void addNum(int num) {
		count++;
		if (count & 0x1 == 1){
			minheap.push(num);
			maxheap.push(minheap.top());
			minheap.pop();
		}
		else{
			maxheap.push(num);
			minheap.push(maxheap.top());
			maxheap.pop();
		}
	}

	double findMedian() {
		if (count & 0x1 == 1)
			return maxheap.top();
		else
			return (maxheap.top() + minheap.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();
*/

GitHub-Leetcode: https://github.com/wenwu313/LeetCode