面试150 数据流的中位数

思路

使用数组法直接完成。

class MedianFinder:def __init__(self):self.stream=list()def addNum(self, num: int) -> None:self.stream.append(num)def findMedian(self) -> float:n=len(self.stream)self.stream.sort() #中位数需要从小到大进行排序if n%2==1:return self.stream[int(n/2)]else:return (self.stream[int(n/2)]+self.stream[int(n/2)-1])/2# Your MedianFinder object will be instantiated and called as such:
# obj = MedianFinder()
# obj.addNum(num)
# param_2 = obj.findMedian()