Example 1:
Input: nums = [8, 2, 4, 7], limit = 4
Output: 2
Explanation:
Example 2:
Input: nums = [10, 1, 2, 4, 7, 2], limit = 5
Output: 4
Explanation:
Example 3:
Input: nums = [4, 2, 2, 2, 4, 4, 2, 2], limit = 0
Output: 3
Explanation:
Given an integer array nums and an integer limit, return the length of the longest non-empty contiguous subarray such that the absolute difference between any two elements in that subarray is less than or equal to limit.
Equivalently, a window is valid when max(window) - min(window) <= limit.
The longest valid subarrays are [2, 4] and [4, 7], each with length 2.
One optimal choice is [2, 4, 7, 2], where the maximum difference is 7 - 2 = 5.
With limit = 0, all values inside the subarray must be equal.
1 <= nums.length <= 10^51 <= nums[i] <= 10^90 <= limit <= 10^9