剑指 Offer 41. 数据流中的中位数(java+python)

如何得到一个数据流中的中位数？如果从数据流中读出奇数个数值，那么中位数就是所有数值排序之后位于中间的数值。如果从数据流中读出偶数个数值，那么中位数就是所有数值排序之后中间两个数的平均值。

例如，

[2,3,4] 的中位数是 3

[2,3] 的中位数是 (2 + 3) / 2 = 2.5

设计一个支持以下两种操作的数据结构：

void addNum(int num) - 从数据流中添加一个整数到数据结构中。
double findMedian() - 返回目前所有元素的中位数。

示例 1：

输入：
["MedianFinder","addNum","addNum","findMedian","addNum","findMedian"]
[[],[1],[2],[],[3],[]]
输出：[null,null,null,1.50000,null,2.00000]

示例 2：

输入：
["MedianFinder","addNum","findMedian","addNum","findMedian"]
[[],[2],[],[3],[]]
输出：[null,null,2.00000,null,2.50000]

限制：

最多会对 addNum、findMedian 进行 50000 次调用。

java

class MedianFinder {
    PriorityQueue<Integer> maxHeap;
    PriorityQueue<Integer> minHeap;
    /** initialize your data structure here. */
    public MedianFinder() {
        maxHeap= new PriorityQueue<Integer>((x,y)->(y-x));
        minHeap= new PriorityQueue<Integer>();
    }
    
    public void addNum(int num) {
        if(maxHeap.size()!=minHeap.size()){
            minHeap.add(num);
            maxHeap.add(minHeap.poll());
        }
        else{
            maxHeap.add(num);
            minHeap.add(maxHeap.poll());
        }
    }
    
    public double findMedian() {
        if(maxHeap.size()!=minHeap.size())return minHeap.peek();
        else return (maxHeap.peek()+minHeap.peek())/2.0;
    }
}

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

python

class MedianFinder(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.maxHeap=list()
        self.minHeap=list()


    def addNum(self, num):
        """
        :type num: int
        :rtype: None
        """
        maxh=self.maxHeap
        minh=self.minHeap
        if len(maxh)!=len(minh):
            heapq.heappush(minh, -num)
            heapq.heappush(maxh, -heapq.heappop(minh))
        else:
            heapq.heappush(maxh, num)
            heapq.heappush(minh, -heapq.heappop(maxh))


    def findMedian(self):
        """
        :rtype: float
        """
        maxh=self.maxHeap
        minh=self.minHeap
        if len(maxh)!=len(minh):
            return -minh[0]
        else:
            return (-minh[0]+maxh[0])/2.0



# Your MedianFinder object will be instantiated and called as such:
# obj = MedianFinder()
# obj.addNum(num)
# param_2 = obj.findMedian()