package sort;
import java.util.Comparator;
import java.util.PriorityQueue;
public class Test41 {
public static void main(String[] args) {
int[] s = { 1, 2 };
System.out.println(addone(s));
}
public static double addone(int[] i) {
int count = 0;
PriorityQueue<Integer> minHead = new PriorityQueue<Integer>();// 小顶堆用于存放较大的部分数
PriorityQueue<Integer> maxHead = new PriorityQueue<>(// 大顶对用于存放较小的部分数
new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
// TODO Auto-generated method stub
return o2 > o1 ? 1 : (o2 == o1 ? 0 : -1);
}
});
for (int j = 0; j < i.length; j++) {
count++;
if ((count & 1) == 0) {// 当加入的次数为偶数是,先将数放入小顶堆,再从小顶堆拿出最小数放入大顶对,
minHead.offer(i[j]);
maxHead.offer(minHead.remove());
} else {// 当加入的次数为奇数是,先将数放入大顶堆,再从大顶堆拿出最小数放入小顶对,
maxHead.offer(i[j]);
minHead.offer(maxHead.remove());
}
}
if ((count & 1) == 0) {
return ((minHead.peek() + maxHead.peek()) / 2.0);
} else {
return minHead.peek();
}
}
}