leetcode 295. Find Median from Data Stream

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.

For example,

[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.

 

Example:

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

 

Follow up:

1. If all integer numbers from the stream are between 0 and 100, how would you optimize it?
2. If 99% of all integer numbers from the stream are between 0 and 100, how would you optimize it?

题目实现一个类，支持addNum和findMedian。

可以每插入一个数就排序一下，或者每次findMedian时如果需要排序一下。不过实际上不需要全排序，所以使用两个堆，分别存储中心位置左侧和右侧的数据，然后返回。代码如下：

class MedianFinder(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.leftNums = []
        self.rightNums = []
    def addNum(self, num):
        """
        :type num: int
        :rtype: None
        """
        heapq.heappush(self.rightNums,num)
        heapq.heappush(self.leftNums,-heapq.heappop(self.rightNums)) #确保leftNums[0] < rightNums[0]
        if len(self.leftNums) > len(self.rightNums) + 1:
            heapq.heappush(self.rightNums,-heapq.heappop(self.leftNums)) # 保证leftNums[0]是中间位置

    def findMedian(self):
        """
        :rtype: float
        """
        if len(self.leftNums) > len(self.rightNums):
            return -self.leftNums[0]
        return (-self.leftNums[0] + self.rightNums[0])/2.0

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