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 non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal to limit.

 

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:


Solution:

class Solution {
    public int longestSubarray(int[] nums, int limit) {
        int left = 0, right = 1, n = nums.length, longest = 1;
        TreeMap<Integer, Integer> map = new TreeMap();
        map.put(nums[0], 1);
        while (right < n) {
            int in = nums[right];
            // System.out.println(map);
            if (!map.isEmpty() && in < map.firstKey()) {
                while (!map.isEmpty() && map.lastKey() - in > limit) {
                    int out = nums[left ++];
                    map.put(out, map.get(out) - 1);
                    if (map.get(out) == 0) map.remove(out);
                }
            }
            if (!map.isEmpty() && in > map.lastKey()) {
                while (!map.isEmpty() && in - map.firstKey() > limit) {
                    int out = nums[left ++];
                    map.put(out, map.get(out) - 1);
                    if (map.get(out) == 0) map.remove(out);
                }
            }
            map.put(in, map.getOrDefault(in, 0) + 1);
            longest = Math.max(longest, right - left + 1);
            right ++;
        }
        return longest;
    }
}