【堆】牛客网：数据流的中位数

代码：

import java.util.PriorityQueue;
public class Solution {
    PriorityQueuemaxheap=new PriorityQueue<>((a,b)->(b-a));
    PriorityQueueminheap=new PriorityQueue<>();
    public void Insert(Integer num) {
           if(maxheap.size()==minheap.size()){
               minheap.add(num);
               maxheap.add(minheap.poll());
           }
        else{
            maxheap.add(num);
            minheap.add(maxheap.poll());
        }
    }
    public Double GetMedian() {
        if(maxheap.size()==minheap.size()){
            return (maxheap.peek()+minheap.peek())/2.0;
        }   
        else{
           return (double)maxheap.peek(); 
        }
    }


}