Update Solution3.ts

Author: yanglbme

solution/1400-1499/1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit/Solution3.ts

@@ -1,24 +1,26 @@
 function longestSubarray(nums: number[], limit: number): number {
-    const maxq: number[] = [];
-    const minq: number[] = [];
     const n = nums.length;
+    let [h1, t1] = [0, -1];
+    let [h2, t2] = [0, -1];
     let l = 0;
+    const maxq = Array(n);
+    const minq = Array(n);
     for (let r = 0; r < n; ++r) {
-        while (maxq.length && nums[maxq.at(-1)!] < nums[r]) {
-            maxq.pop();
+        while (h1 <= t1 && nums[maxq[t1]] < nums[r]) {
+            --t1;
         }
-        while (minq.length && nums[minq.at(-1)!] > nums[r]) {
-            minq.pop();
+        while (h2 <= t2 && nums[minq[t2]] > nums[r]) {
+            --t2;
         }
-        maxq.push(r);
-        minq.push(r);
-        if (nums[maxq[0]] - nums[minq[0]] > limit) {
-            l++;
-            if (maxq[0] < l) {
-                maxq.shift();
+        maxq[++t1] = r;
+        minq[++t2] = r;
+        if (nums[maxq[h1]] - nums[minq[h2]] > limit) {
+            ++l;
+            if (maxq[h1] < l) {
+                ++h1;
             }
-            if (minq[0] < l) {
-                minq.shift();
+            if (minq[h2] < l) {
+                ++h2;
             }
         }
     }