sliding-window-maximum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of integers&nbsp;<code>nums</code>, there is a sliding window of size <code>k</code> which is moving from the very left of the array to the very right. You can only see the <code>k</code> numbers in the window. Each time the sliding window moves right by one position.

Return the max sliding window.

&nbsp;
Example 1:

<pre>
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
</pre>

Example 2:

<pre>
Input: nums = [1], k = 1
Output: [1]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>

maxSlidingWindow

Sliding Window Maximum

Minimum Window Substring

minimum-window-substring

最小覆盖子串

Min Stack

min-stack

最小栈

Longest Substring with At Most Two Distinct Characters

longest-substring-with-at-most-two-distinct-characters

至多包含两个不同字符的最长子串

Paint House II

paint-house-ii

粉刷房子 II

Jump Game VI

jump-game-vi

跳跃游戏 VI

Maximum Number of Robots Within Budget

maximum-number-of-robots-within-budget

预算内的最多机器人数目

Maximum Tastiness of Candy Basket

maximum-tastiness-of-candy-basket

礼盒的最大甜蜜度

Maximal Score After Applying K Operations

maximal-score-after-applying-k-operations

执行 K 次操作后的最大分数

Queue

Array

Sliding Window

Monotonic Queue

Heap (Priority Queue)

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

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

&nbsp;

示例 1：

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

示例 2：

<pre>
输入：nums = [1], k = 1
输出：[1]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-104&nbsp;&lt;= nums[i] &lt;= 104</code></li>
	<li><code>1 &lt;= k &lt;= nums.length</code></li>
</ul>