[LeetCode 239] Sliding Window Maximum (Queap/队列快速求最大值)

239. 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].

---

题解:

　　题目需要快速求连续区间的最大值，为了使总体复杂度为线性，需要求最大值的复杂度为O(1)，因此不能使用线段树、树状数组等方法来求。得益于我们需要求的区间每次移动只有1个单位，我们可以通过队列来模拟这个区间的运动，而队列通过巧妙的设计可以做到O(1)求队列最值。(Queap)
　　为了给队列增加getMax()操作，我们需要多设置一个双端队列deq维护最大值的信息。在push一个新值x时&#x