Skip to content

sliding-window-maximum.md

Latest commit

 

History

History
147 lines (105 loc) · 4.45 KB

sliding-window-maximum.md

File metadata and controls

147 lines (105 loc) · 4.45 KB

239. Sliding Window Maximum - 滑动窗口最大值

Tags - 题目标签

Description - 题目描述

EN:

You are given an array of integers 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.

Return the max sliding window.

 

Example 1:

Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
Output: [3,3,5,5,6,7]
Explanation: 
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

Example 2:

Input: nums = [1], k = 1
Output: [1]

 

Constraints:

  • 1 <= nums.length <= 105
  • -104 <= nums[i] <= 104
  • 1 <= k <= nums.length

ZH-CN:

给你一个整数数组 nums，有一个大小为 k 的滑动窗口从数组的最左侧移动到数组的最右侧。你只可以看到在滑动窗口内的 k 个数字。滑动窗口每次只向右移动一位。

返回 滑动窗口中的最大值 。

 

示例 1：

输入：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

示例 2：

输入：nums = [1], k = 1
输出：[1]

 

提示：

  • 1 <= nums.length <= 105
  • -104 <= nums[i] <= 104
  • 1 <= k <= nums.length

Link - 题目链接

LeetCode - LeetCode-CN

Latest Accepted Submissions - 最近一次 AC 的提交

Language Runtime Memory Submission Time
typescript 6236 ms 79.3 MB 2022/04/23 18:38 
function maxSlidingWindow(nums: number[], k: number): number[] {
  if (k === 1) {
    return nums;
  }

  const monotoneQueue: number[] = [], res: number[] = [];

  for (let i = 0; i < k; i++) {
    while (monotoneQueue[monotoneQueue.length - 1] !== undefined && monotoneQueue[monotoneQueue.length - 1] < nums[i]) {
      monotoneQueue.pop();
    }
    monotoneQueue.push(nums[i]);
  }

  if (nums[0] === monotoneQueue[0]) {
    const top = monotoneQueue.shift();
    res.push(top);
  } else {
    res.push(monotoneQueue[0]);
  }

  for (let i = k; i < nums.length; i++) {
    while (monotoneQueue[monotoneQueue.length - 1] !== undefined && monotoneQueue[monotoneQueue.length - 1] < nums[i]) {
      monotoneQueue.pop();
    }
    monotoneQueue.push(nums[i]);

    if (nums[i - k + 1] === monotoneQueue[0]) {
      const top = monotoneQueue.shift();
      res.push(top);
    } else {
      res.push(monotoneQueue[0]);
    }
  }

  return res;
};

My Notes - 我的笔记

本题与 剑指 Offer 59 - I. 滑动窗口的最大值 相同，可参考那边的题解。