mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
48 lines
1.5 KiB
HTML
48 lines
1.5 KiB
HTML
<p>给你一个整数数组 <code>nums</code> ，和一个表示限制的整数 <code>limit</code>，请你返回最长连续子数组的长度，该子数组中的任意两个元素之间的绝对差必须小于或者等于 <code>limit</code><em>。</em></p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [8,2,4,7], limit = 4
|
||
<strong>输出：</strong>2
|
||
<strong>解释：</strong>所有子数组如下：
|
||
[8] 最大绝对差 |8-8| = 0 <= 4.
|
||
[8,2] 最大绝对差 |8-2| = 6 > 4.
|
||
[8,2,4] 最大绝对差 |8-2| = 6 > 4.
|
||
[8,2,4,7] 最大绝对差 |8-2| = 6 > 4.
|
||
[2] 最大绝对差 |2-2| = 0 <= 4.
|
||
[2,4] 最大绝对差 |2-4| = 2 <= 4.
|
||
[2,4,7] 最大绝对差 |2-7| = 5 > 4.
|
||
[4] 最大绝对差 |4-4| = 0 <= 4.
|
||
[4,7] 最大绝对差 |4-7| = 3 <= 4.
|
||
[7] 最大绝对差 |7-7| = 0 <= 4.
|
||
因此，满足题意的最长子数组的长度为 2 。
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [10,1,2,4,7,2], limit = 5
|
||
<strong>输出：</strong>4
|
||
<strong>解释：</strong>满足题意的最长子数组是 [2,4,7,2]，其最大绝对差 |2-7| = 5 <= 5 。
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [4,2,2,2,4,4,2,2], limit = 0
|
||
<strong>输出：</strong>3
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
||
<li><code>0 <= limit <= 10<sup>9</sup></code></li>
|
||
</ul>
|