add 1438

Author: fishercoder1534

README.md

@@ -308,6 +308,7 @@ _If you like this project, please leave me a star._ ★
 |1446|[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java) | |Easy|String|
 |1441|[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java) | |Easy|Stack|
 |1439|[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1439.java) | |Hard|Array, Binary Search, PriorityQueue, Matrix|
+|1438|[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1438.java) | |Medium|Array, Queue, Sliding Window, PriorityQueue, Monotonic Queue|
 |1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | |Medium|Array|
 |1436|[Destination City](https://leetcode.com/problems/destination-city/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | |Easy|String|
 |1432|[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) | |Medium|String|

src/main/java/com/fishercoder/solutions/_1438.java

@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.PriorityQueue;
+
+public class _1438 {
+    public static class Solution1 {
+        /**
+         * My completely original solution on 1/19/2022.
+         */
+        public int longestSubarray(int[] nums, int limit) {
+            int ans = 0;
+            PriorityQueue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
+            PriorityQueue<Integer> minHeap = new PriorityQueue<>();
+            for (int left = 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++;
+                }
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/_1438Test.java

@@ -0,0 +1,45 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1438;
+import com.fishercoder.solutions._3;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1438Test {
+    private static _1438.Solution1 solution1;
+    private static int[] nums;
+    private static int limit;
+    private static int expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1438.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        expected = 2;
+        nums = new int[]{8, 2, 4, 7};
+        limit = 4;
+        assertEquals(expected, solution1.longestSubarray(nums, limit));
+    }
+
+    @Test
+    public void test2() {
+        expected = 4;
+        nums = new int[]{10, 1, 2, 4, 7, 2};
+        limit = 5;
+        assertEquals(expected, solution1.longestSubarray(nums, limit));
+    }
+
+    @Test
+    public void test3() {
+        expected = 3;
+        nums = new int[]{4, 2, 2, 2, 4, 4, 2, 2};
+        limit = 0;
+        assertEquals(expected, solution1.longestSubarray(nums, limit));
+    }
+
+}