/**
*思路:设置一个大顶堆和一个小顶堆,如果奇数个返回大顶堆堆顶,偶数个返回(大顶堆+小顶堆)/2
*其中大顶堆的个数等于小顶堆的个数或者比小顶堆多一个
*大顶堆中的最大数小于小顶堆的最小数
*如果是奇数个数,大顶堆->小顶堆->大顶堆
*偶数个,大顶堆->小顶堆
*/
class MedianFinder {
private int count;
private PriorityQueue<Integer> maxHeap;
private PriorityQueue<Integer> minHeap;
public MedianFinder() {
count=0;
maxHeap= new PriorityQueue<>((x,y)->y-x);
minHeap = new PriorityQueue<>();
}
public void addNum(int num) {
count++;
maxHeap.offer(num);
minHeap.add(maxHeap.poll());
if((count & 1) != 0){
maxHeap.add(minHeap.poll());
}
}
public double findMedian() {
if((count & 1) == 0){
return (double)(maxHeap.peek()+minHeap.peek())/2;
}else{
return maxHeap.peek();
}
}
}