_1438.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.PriorityQueue;

publicclass_1438 {
publicstaticclassSolution1 {
/*
 * My completely original solution on 1/19/2022.
 */
publicintlongestSubarray(int[] nums, intlimit) {
intans = 0;
PriorityQueue<Integer> maxHeap = newPriorityQueue<>((a, b) -> b - a);
PriorityQueue<Integer> minHeap = newPriorityQueue<>();
for (intleft = 0, right = 0; left < nums.length && right < nums.length; right++) {
if (ans == 0) {
ans = 1;
 }
maxHeap.offer(nums[right]);
minHeap.offer(nums[right]);
if (!maxHeap.isEmpty()
 && !minHeap.isEmpty()
 && (maxHeap.peek() - minHeap.peek() <= limit)) {
ans = Math.max(ans, right - left + 1);
 } else {
maxHeap.remove(nums[left]);
minHeap.remove(nums[left]);
left++;
 }
 }
returnans;
 }
 }
}