mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
46 lines
1.6 KiB
HTML
46 lines
1.6 KiB
HTML
<p>Given an array of integers <code>nums</code> and an integer <code>limit</code>, return the size of the longest <strong>non-empty</strong> subarray such that the absolute difference between any two elements of this subarray is less than or equal to <code>limit</code><em>.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [8,2,4,7], limit = 4
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> All subarrays are:
|
|
[8] with maximum absolute diff |8-8| = 0 <= 4.
|
|
[8,2] with maximum absolute diff |8-2| = 6 > 4.
|
|
[8,2,4] with maximum absolute diff |8-2| = 6 > 4.
|
|
[8,2,4,7] with maximum absolute diff |8-2| = 6 > 4.
|
|
[2] with maximum absolute diff |2-2| = 0 <= 4.
|
|
[2,4] with maximum absolute diff |2-4| = 2 <= 4.
|
|
[2,4,7] with maximum absolute diff |2-7| = 5 > 4.
|
|
[4] with maximum absolute diff |4-4| = 0 <= 4.
|
|
[4,7] with maximum absolute diff |4-7| = 3 <= 4.
|
|
[7] with maximum absolute diff |7-7| = 0 <= 4.
|
|
Therefore, the size of the longest subarray is 2.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [10,1,2,4,7,2], limit = 5
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 <= 5.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [4,2,2,2,4,4,2,2], limit = 0
|
|
<strong>Output:</strong> 3
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</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>
|