public double getMedian() {
if ((minAndMaxHeaps.maxSize() + minAndMaxHeaps.minSize()) % 2 == 0) {
int resultingMax = minAndMaxHeaps.peekMax();
int resultingMin = minAndMaxHeaps.peekMin();
return (double) (resultingMax + resultingMin) / 2;
} else if (minAndMaxHeaps.maxSize() > minAndMaxHeaps.minSize()) {
return minAndMaxHeaps.peekMax();
}
return minAndMaxHeaps.peekMin();
}
public void add(int element) {
if (minAndMaxHeaps.isMaxEmpty()) {
if (minAndMaxHeaps.isMinEmpty()) {
minAndMaxHeaps.offerMax(element);
} else {
int min = minAndMaxHeaps.pollMin();
setElementsByComarison(element, min);
}
logger.info("added element [" + element + "], median [" + getMedian() + "]");
return;
} else if (minAndMaxHeaps.isMinEmpty()) {
if (minAndMaxHeaps.isMaxEmpty()) {
minAndMaxHeaps.offerMin(element);
} else {
int max = minAndMaxHeaps.pollMax();
setElementsByComarison(max, element);
}
logger.info("added element [" + element + "], median [" + getMedian() + "]");
return;
}
int max = minAndMaxHeaps.peekMax();
int min = minAndMaxHeaps.peekMin();
if (max >= element) {
if (minAndMaxHeaps.maxSize() <= minAndMaxHeaps.minSize()) {
minAndMaxHeaps.offerMax(element);
} else {
int polledMax = minAndMaxHeaps.pollMax();
minAndMaxHeaps.offerMin(polledMax);
minAndMaxHeaps.offerMax(element);
}
} else if (min <= element) {
if (minAndMaxHeaps.minSize() <= minAndMaxHeaps.maxSize()) {
minAndMaxHeaps.offerMin(element);
} else {
int polledMin = minAndMaxHeaps.pollMin();
minAndMaxHeaps.offerMax(polledMin);
minAndMaxHeaps.offerMin(element);
}
} else {
if (minAndMaxHeaps.maxSize() < minAndMaxHeaps.minSize()) {
minAndMaxHeaps.offerMax(element);
} else {
minAndMaxHeaps.offerMax(element);
}
}
logger.info("added element [" + element + "], median [" + getMedian() + "]");
}