数据流中的中位数_63

   int count=0;
    PriorityQueue<Integer> minHeap=new PriorityQueue<>();
    PriorityQueue<Integer> maxHeap=new PriorityQueue<>(new Comparator<Integer>() {
        @Override
        public int compare(Integer o1, Integer o2) {
            return o2-o1;
        }
    });

    public void Insert(Integer num) {
        //如果是奇数
        if ((count&1)==0){
            minHeap.offer(num);
            maxHeap.offer(minHeap.poll());
        }else{
            maxHeap.offer(num);
            minHeap.offer(maxHeap.poll());
        }
        count++;
    }

    public Double GetMedian() {
        //如果是奇数
        if ((count&1)!=0){
            return new Double(maxHeap.peek());
        }else {
            return new Double((maxHeap.peek()+minHeap.peek()))/2;
        }
    }