思路
中位数:有序列表的中间值,用sort()进行排序
(self.stack[t//2-1]+self.stack[t//2])/float(2),记得要用float
class MedianFinder(object):
def __init__(self):
self.stack=[]
def addNum(self, num):
"""
:type num: int
:rtype: None
"""
self.stack.append(num)
def findMedian(self):
"""
:rtype: float
"""
self.stack.sort()
t=len(self.stack)
if t%2==0:
return (self.stack[t//2-1]+self.stack[t//2])/float(2)
return self.stack[t//2]
# Your MedianFinder object will be instantiated and called as such:
# obj = MedianFinder()
# obj.addNum(num)
# param_2 = obj.findMedian()