295. Find Median from Data Stream【H】【2.7】
2016-06-02 09:14
309 查看
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.
Examples:
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.
For example:
Credits:
Special thanks to @Louis1992 for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
关键有两个,一个是使用最小堆
另一个是,算法上,把整个分成两部分,一个装较小的一半儿,一个装较大的一半儿
from heapq import *
class MedianFinder:
def __init__(self):
self.small = []
self.large = []
"""
Initialize your data structure here.
"""
def addNum(self, num):
s = self.small
l = self.large
if len(s) + len(l) < 2:
if len(l) == 0:
heappush(l,num)
else:
heappush(s,-heappushpop(l,num))
return
a = -heappop(s)
b = heappop(l)
maxx = max(a,max(b,num))
minn = min(a,min(b,num))
num = a + b + num - minn - maxx
heappush(l,num)
heappush(l,maxx)
heappush(s,-minn)
if len(s) < len(l) - 1:
heappush(s, -heappop(l))
"""
Adds a num into the data structure.
:type num: int
:rtype: void
"""
def findMedian(self):
s = self.small
l = self.large
if len(s) == len(l):
return (l[0] - s[0]) / 2.0
return l[0]/1.0
"""
Returns the median of current data stream
:rtype: float
"""
# Your MedianFinder object will be instantiated and called as such:
# mf = MedianFinder()
# mf.addNum(1)
# mf.findMedian()
Examples:
[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.
For example:
add(1) add(2) findMedian() -> 1.5 add(3) findMedian() -> 2
Credits:
Special thanks to @Louis1992 for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
关键有两个,一个是使用最小堆
另一个是,算法上,把整个分成两部分,一个装较小的一半儿,一个装较大的一半儿
from heapq import *
class MedianFinder:
def __init__(self):
self.small = []
self.large = []
"""
Initialize your data structure here.
"""
def addNum(self, num):
s = self.small
l = self.large
if len(s) + len(l) < 2:
if len(l) == 0:
heappush(l,num)
else:
heappush(s,-heappushpop(l,num))
return
a = -heappop(s)
b = heappop(l)
maxx = max(a,max(b,num))
minn = min(a,min(b,num))
num = a + b + num - minn - maxx
heappush(l,num)
heappush(l,maxx)
heappush(s,-minn)
if len(s) < len(l) - 1:
heappush(s, -heappop(l))
"""
Adds a num into the data structure.
:type num: int
:rtype: void
"""
def findMedian(self):
s = self.small
l = self.large
if len(s) == len(l):
return (l[0] - s[0]) / 2.0
return l[0]/1.0
"""
Returns the median of current data stream
:rtype: float
"""
# Your MedianFinder object will be instantiated and called as such:
# mf = MedianFinder()
# mf.addNum(1)
# mf.findMedian()
相关文章推荐
- Raspberry Pi3 ~ C语言控制串口
- 程序员必备神器
- css样式大全(整理版)
- 第十四周项目三-数组类模板
- 备份一个自己网页
- 由一个属性设置导致的一系列问题排查
- AFN网络请求打印请求失败的错误
- mysql 全文检索 百万条记录的快速检索
- 程序员必备神器
- 程序员必备神器
- 第七周-项目一(2)-两点间距离
- JavaScript学习--Item32 DOM基础详解2
- 关于泛型的一点应用(数值类型间的转换)
- ViewPager+Fragment取消预加载(延迟加载)
- 第十四周项目2——两个成员的类模板
- PKU MOOC作业魔兽世界之一:备战的结构化程序
- 第14周项目2:两个成员的类模板(2)
- 深入理解计算机系统 2
- Android中实现倒计时的方法总结
- PageRank 理解