栈和队列_滑动窗口的最大值|算法专题

输入: nums = [1,3,-1,-3,5,3,6,7], 和 k = 3
输出: [3,3,5,5,6,7]
解释:
  滑动窗口的位置                最大值
---------------               -----
[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

    var maxSlidingWindow = function (nums, k) {
      const window = [];
      const result = [];
      for (let i = 0; i < nums.length; i++) {
        if (i - window[0] > k - 1) {
          window.shift();
        }
        let j = window.length - 1;
        while (j >= 0 && nums[window[j]] <= nums[i]) {
          j--;
          window.pop();
        }
        window.push(i);
        if (i >= k - 1) {
          result.push(nums[window[0]]);
        }
      }
      return result;
    };