LeetCode-Find Median from Data Stream

Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.

Examples:

[2,3,4] , the median is 3

[2,3], the median is (2 + 3) / 2 = 2.5

Design a data structure that supports the following two operations:

• void addNum(int num) - Add a integer number from the data stream to the data structure.
• double findMedian() - Return the median of all elements so far.

For example:

add(1)
add(2)
findMedian() -> 1.5
add(3) 
findMedian() -> 2

Credits:
Special thanks to @Louis1992 for adding this problem and creating all test cases.

Solution:

public class MedianFinder {
    // small part, max heap
    PriorityQueue<Integer> small = new PriorityQueue<Integer>((a, b) -> (b - a));

    // large part, min heap, contains median if odd number of numbers are added.
    PriorityQueue<Integer> large = new PriorityQueue<Integer>();

    // Adds a number into the data structure.
    public void addNum(int num) {
        if (large.isEmpty()) {
            large.add(num);
            return;
        }

        // total number is even
        if (small.size()==large.size()) {
            if (num >= small.peek()) {
                // add it to large.
                large.add(num);
            } else {
                small.add(num);
                large.add(small.poll());
            }
        } else {
            if (num > large.peek()) {
                large.add(num);
                small.add(large.poll());
            } else {
                small.add(num);
            }
        }
    }

    // Returns the median of current data stream
    public double findMedian() {
        if (small.size()==large.size()){
            return (double) (small.peek()+large.peek())/2;
        } else {
            return (double) large.peek();
        }
    }

};

// Your MedianFinder object will be instantiated and called as such:
// MedianFinder mf = new MedianFinder();
// mf.addNum(1);
// mf.findMedian();