test.py

class MedianFinder:

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

    def addNum(self, num: int) -> None:
        if len(self.maxHeap) == 0:
            self.maxHeap.append(-num)
            return
        
        biggerThanMaxHeap = num > -self.maxHeap[0]
        
        if biggerThanMaxHeap:
            heapq.heappush(self.minHeap, num)
        else:
            heapq.heappush(self.maxHeap, -num)
            
        while len(self.maxHeap) - len(self.minHeap) > 1:
            ele = heapq.heappop(self.maxHeap)
            heapq.heappush(self.minHeap, -ele)
         
        while len(self.minHeap) - len(self.maxHeap) > 1:
            ele = heapq.heappop(self.minHeap)
            heapq.heappush(self.maxHeap, -ele)
        
    def findMedian(self) -> float:
        if len(self.minHeap) == len(self.maxHeap):
            return (self.minHeap[0] - self.maxHeap[0]) / 2
        if len(self.minHeap) > len(self.maxHeap):
            return self.minHeap[0]
        else:
            return -self.maxHeap[0]
        


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