题目链接
https://leetcode-cn.com/problems/find-median-from-data-stream/
描述
中位数是有序列表中间的数。如果列表长度是偶数,中位数则是中间两个数的平均值。
进阶:
如果数据流中所有整数都在 0 到 100 范围内,你将如何优化你的算法?
如果数据流中 99% 的整数都在 0 到 100 范围内,你将如何优化你的算法?
示例
例如,
[2,3,4] 的中位数是 3
[2,3] 的中位数是 (2 + 3) / 2 = 2.5
设计一个支持以下两种操作的数据结构:
void addNum(int num) - 从数据流中添加一个整数到数据结构中。
double findMedian() - 返回目前所有元素的中位数。
示例:
addNum(1)
addNum(2)
findMedian() -> 1.5
addNum(3)
findMedian() -> 2
初始代码模板
class MedianFinder {
/** initialize your data structure here. */
public MedianFinder() {
}
public void addNum(int num) {
}
public double findMedian() {
}
}
/**
* Your MedianFinder object will be instantiated and called as such:
* MedianFinder obj = new MedianFinder();
* obj.addNum(num);
* double param_2 = obj.findMedian();
*/
代码
思路非常巧妙,推荐题解如下:
https://leetcode-cn.com/problems/find-median-from-data-stream/solution/you-xian-dui-lie-python-dai-ma-java-dai-ma-by-liwe/
https://labuladong.gitbook.io/algo/shu-ju-jie-gou-xi-lie/shu-ju-liu-zhong-wei-shu
class MedianFinder {
private int count;
private PriorityQueue<Integer> maxHeap;
private PriorityQueue<Integer> minHeap;
/** initialize your data structure here. */
public MedianFinder() {
this.count = 0;
//默认是小顶堆,转为大顶堆
this.maxHeap = new PriorityQueue<>((a, b) -> b - a);
this.minHeap = new PriorityQueue<>();
}
public void addNum(int num) {
count += 1;
maxHeap.offer(num);
minHeap.offer(maxHeap.poll());
if ((count & 1) == 1) {
maxHeap.offer(minHeap.poll());
}
}
public double findMedian() {
if ((count & 1) == 0) {
return (maxHeap.peek() + minHeap.peek()) / 2.0;
} else {
return (double) maxHeap.peek();
}
}
}
/**
* Your MedianFinder object will be instantiated and called as such:
* MedianFinder obj = new MedianFinder();
* obj.addNum(num);
* double param_2 = obj.findMedian();
*/