Class Solution
-
- All Implemented Interfaces:
public final class Solution1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.
Medium
Given an array of integers
numsand an integerlimit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal tolimit.Example 1:
Input: nums = 8,2,4,7, limit = 4
Output: 2
Explanation: 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.
Example 2:
Input: nums = 10,1,2,4,7,2, limit = 5
Output: 4
Explanation: The subarray 2,4,7,2 is the longest since the maximum absolute diff is |2-7| = 5 <= 5.
Example 3:
Input: nums = 4,2,2,2,4,4,2,2, limit = 0
Output: 3
Constraints:
<code>1 <= nums.length <= 10<sup>5</sup></code>
<code>1 <= numsi<= 10<sup>9</sup></code>
<code>0 <= limit <= 10<sup>9</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntegerlongestSubarray(IntArray nums, Integer limit)-
-
Method Detail
-
longestSubarray
final Integer longestSubarray(IntArray nums, Integer limit)
-
-
-
-