#258 · #1438 · Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit(绝对差不超过限制的最长连续子数组)

Given an array of integers nums and an integer limit, return the size of the longest subarray such that the absolute difference between any two of its elements is at most limit. Constraints: 1 <= nums.length <= 10^5, 1 <= nums[i] <= 10^9, 0 <= limit <= 10^9.