mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-27 10:40:26 +08:00
39 lines
1.2 KiB
HTML
39 lines
1.2 KiB
HTML
|
<p>给你一个整数数组 <code>nums</code>，有一个大小为 <code>k</code><em> </em>的滑动窗口从数组的最左侧移动到数组的最右侧。你只可以看到在滑动窗口内的 <code>k</code> 个数字。滑动窗口每次只向右移动一位。</p>
|
|||
|
|
|
|||
|
|
<p>返回 <em>滑动窗口中的最大值 </em>。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<b>输入：</b>nums = [1,3,-1,-3,5,3,6,7], k = 3
|
|||
|
|
<b>输出：</b>[3,3,5,5,6,7]
|
|||
|
|
<b>解释：</b>
|
|||
|
|
滑动窗口的位置 最大值
|
|||
|
|
--------------- -----
|
|||
|
|
[1 3 -1] -3 5 3 6 7 <strong>3</strong>
|
|||
|
|
1 [3 -1 -3] 5 3 6 7 <strong>3</strong>
|
|||
|
|
1 3 [-1 -3 5] 3 6 7 <strong> 5</strong>
|
|||
|
|
1 3 -1 [-3 5 3] 6 7 <strong>5</strong>
|
|||
|
|
1 3 -1 -3 [5 3 6] 7 <strong>6</strong>
|
|||
|
|
1 3 -1 -3 5 [3 6 7] <strong>7</strong>
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<b>输入：</b>nums = [1], k = 1
|
|||
|
|
<b>输出：</b>[1]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><b>提示：</b></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|||
|
|
<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>1 <= k <= nums.length</code></li>
|
|||
|
|
</ul>
|