【leetcode每日刷题】295. Find Median from Data Stream

https://leetcode.com/problems/find-median-from-data-stream/

使用两个堆，small采用最大堆存储左半边较小的数，large采用最小堆存储右半边较大的数。每次是small堆的值个数和large中的相等或者多一个，small中的最大值始终小于large中的最小值。

import java.util.PriorityQueue;
import java.util.Queue;

class MedianFinder {
    private Queue<Integer> small;
    private Queue<Integer> large; //从小到大，存放右半边偏大的数
    int count = 0;
    /** initialize your data structure here. */
    public MedianFinder() {
        small = new PriorityQueue<Integer>((i1,i2)->(i2-i1));
        large = new PriorityQueue<Integer>(); //从小到大，存放右半边偏大的数
    }
    
    public void addNum(int num) {
        if(count % 2 == 0) small.offer(num);
        else large.offer(num);
        if(!small.isEmpty() && !large.isEmpty() && small.peek() > large.peek()){
            small.offer(large.poll());
            large.offer(small.poll());
        }
        count += 1;
    }
    
    public double findMedian() {
        return small.size() > large.size()? small.peek() : (small.peek()+large.peek())/2.0;
    }
}

/**
 * Your MedianFinder object will be instantiated and called as such:
 * MedianFinder obj = new MedianFinder();
 * obj.addNum(num);
 * double param_2 = obj.findMedian();
 */