Leetcode: Sliding Window Median

 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

 Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Your job is to output the median array for each window in the original array.

 For example,
 Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.

 Window position                Median
 ---------------               -----
 [1  3  -1] -3  5  3  6  7       1
  1 [3  -1  -3] 5  3  6  7       -1
  1  3 [-1  -3  5] 3  6  7       -1
  1  3  -1 [-3  5  3] 6  7       3
  1  3  -1  -3 [5  3  6] 7       5
  1  3  -1  -3  5 [3  6  7]      6
 Therefore, return the median sliding window as [1,-1,-1,3,5,6].

方法1：Time Complexity O(NK)

暂时只有两个Heap的做法，缺点：In this problem, it is necessary to be able remove elements that are not necessarily at the top of the heap. PriorityQueue has logarithmic time remove top, but a linear time remove arbitrary element.

For a Heap:

remove():  Time Complexity is O(logN)

remove(Object): Time Complexity is O(N)

更好的有multiset的方法，但是还没有看到好的java version的

最大堆的简单定义方法：Collections.reverseOrder(), Returns a comparator that imposes the reverse of the natural ordering on a collection of objects

 public class Solution {
     PriorityQueue<Double> high = new PriorityQueue();
     PriorityQueue<Double> low = new PriorityQueue(Collections.reverseOrder());

     public double[] medianSlidingWindow(int[] nums, int k) {
         double[] res = new double[nums.length-k+1];
         int index = 0;

         for (int i=0; i<nums.length; i++) {
             if (i >= k) remove(nums[i-k]);
             add((double)nums[i]);
             if (i >= k-1) {
                 res[index++] = findMedian();
             }
         }
         return res;
     }

     public void add(double num) {
         low.offer(num);
         high.offer(low.poll());
         if (low.size() < high.size()) {
             low.offer(high.poll());
         }
     }

     public double findMedian() {
         if (low.size() == high.size()) {
             return (low.peek() + high.peek()) / 2.0;
         }
         else return low.peek();
     }

     public void remove(double num) {
         if (num <= findMedian()) {
             low.remove(num);
         }
         else {
             high.remove(num);
         }
         if (low.size() < high.size()) {
             low.offer(high.poll());
         }
         else if (low.size() > high.size()+1) {
             high.offer(low.poll());
         }
     }
 }