1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

 JAVA

• class Solution {
      public int longestSubarray(int[] nums, int limit) {
          TreeMap<Integer, Integer> tm = new TreeMap<>();
          int ans = 0, j = 0;
          for (int i = 0; i < nums.length; ++i) {
              tm.put(nums[i], tm.getOrDefault(nums[i], 0) + 1);
              while (tm.lastKey() - tm.firstKey() > limit) {
                  tm.put(nums[j], tm.get(nums[j]) - 1);
                  if (tm.get(nums[j]) == 0) {
                      tm.remove(nums[j]);
                  }
                  ++j;
              }
              ans = Math.max(ans, i - j + 1);
          }
          return ans;
      }
  }

C++

• class Solution {
  public:
      int longestSubarray(vector<int>& nums, int limit) {
          multiset<int> s;
          int ans = 0, j = 0;
          for (int i = 0; i < nums.size(); ++i) {
              s.insert(nums[i]);
              while (*s.rbegin() - *s.begin() > limit) {
                  s.erase(s.find(nums[j++]));
              }
              ans = max(ans, i - j + 1);
          }
          return ans;
      }
  };