Easy Python solution with 2 heaps
\nfrom heapq import heappush, heappop, heapreplace, heapify\nclass MedianFinder(object):\n\n    def __init__(self):\n        #keep smaller half (size >= 1)\n   
```\nfrom heapq import heappush, heappop, heapreplace, heapify\nclass MedianFinder(object):\n\n    def __init__(self):\n        #keep smaller half (size >= 1)\n        self.maxHeap = []\n        self.minHeap = []\n\n    def addNum(self, num):\n        heappush(self.maxHeap, -num)\n        heappush(self.minHeap, -heappop(self.maxHeap))\n        if len(self.minHeap) > len(self.maxHeap):\n            heappush(self.maxHeap, -heappop(self.minHeap))\n            \n\n    def findMedian(self):\n        if len(self.maxHeap) > len(self.minHeap):\n            return float(-self.maxHeap[0])\n        return ((-self.maxHeap[0] + self.minHeap[0] + 0.00 )/2)\n\t```\t
[]