数据流中的中位数 --剑指offer

import java.util.*;
public class Solution {
    PriorityQueue<Integer> min=new PriorityQueue<>();
    PriorityQueue<Integer> max=new PriorityQueue<>(new Comparator<Integer>() {
            @Override
        public int compare(Integer o1, Integer o2) {
            return o2.compareTo(o1);
        }
    });
    int count=0;
    public void Insert(Integer num) {
        count++;
        if(count % 2 != 0){ //奇数
            max.offer(num);
            min.offer(max.poll());
        }else {
            min.offer(num);
            max.offer(min.poll());
        }
    }

    public Double GetMedian() {
        if(count % 2 != 0){
            return 1.0*min.peek();
        }else {
            return (min.peek() + max.peek())/2.0;
        }
    }

}