1.双端队列法

  1. /*
  2.  * @lc app=leetcode.cn id=239 lang=javascript
  3.  *
  4.  * [239] 滑动窗口最大值
  5.  */
  7. // @lc code=start
  8. /**
  9.  * @param {number[]} nums
  10.  * @param {number} k
  11.  * @return {number[]}
  12.  */
  13. var maxSlidingWindow = function (nums, k) {
  14.   if (nums.length === 0 || !k) return []
  15.   let windows = []
  16.   let res = []
  17.   for (let i = 0; i < nums.length; i++) {
  18.     if (windows[0] !== undefined && windows[0] <= i - k) windows.shift()
  19.     while (nums[windows[windows.length - 1]] <= nums[i]) windows.pop()
  20.     windows.push(i)
  21.     if (i >= k - 1) res.push(nums[windows[0]])
  22.   }
  23.   return res
  24. }
  25. // @lc code=end