Sliding Window Maximum

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.

For example,

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

Window position                Max
---------------               -----
[1  3  -1] -3  5  3  6  7       3
 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       5
 1  3  -1  -3 [5  3  6] 7       6
 1  3  -1  -3  5 [3  6  7]      7

Therefore, return the max sliding window as [3,3,5,5,6,7].

Note: 

You may assume k is always valid, ie: 1 ≤ k ≤ input array's size for non-empty array.

Follow up:

Could you solve it in linear time?

求滑动窗口的最大值。

使用一个双向队列存储可能成为最大值的数值。队列中大的元素在前，小的元素在后，

当遇到一个新元素时，从队列后面删除比其小的元素。当队列的头等于数组中窗口

之前的元素时，将其删掉。返回的数组就是每一次的队列头元素。

public class Solution {
    public int[] maxSlidingWindow(int[] nums, int k) {
        if(nums==null||k==0)
            return new int[0];
        int[] ans = new int[nums.length-k+1];
        Deque<Integer> deque = new ArrayDeque<Integer>();
        int i = 0;
        for(int now : nums) {
            i++;
    		while((!deque.isEmpty() && now > deque.peekLast())) 
    			deque.pollLast();
    		deque.offer(now);
    		if(i > k  && deque.peekFirst() == nums[i - k - 1])
    		         deque.pollFirst();
    		if(i >= k) 
    			ans[i-k]=deque.peekFirst();
        }
        return ans;
    }
}