[LeetCode Sync] Runtime - 119 ms (99.05%), Memory - 27.1 MB (40.52%)

Author: NinePiece2

Solutions/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/README.md

@@ -0,0 +1,45 @@
+<p>Given an array of integers <code>nums</code> and an integer <code>limit</code>, return the size of the longest <strong>non-empty</strong> subarray such that the absolute difference between any two elements of this subarray is less than or equal to <code>limit</code><em>.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [8,2,4,7], limit = 4
+<strong>Output:</strong> 2 
+<strong>Explanation:</strong> All subarrays are: 
+[8] with maximum absolute diff |8-8| = 0 &lt;= 4.
+[8,2] with maximum absolute diff |8-2| = 6 &gt; 4. 
+[8,2,4] with maximum absolute diff |8-2| = 6 &gt; 4.
+[8,2,4,7] with maximum absolute diff |8-2| = 6 &gt; 4.
+[2] with maximum absolute diff |2-2| = 0 &lt;= 4.
+[2,4] with maximum absolute diff |2-4| = 2 &lt;= 4.
+[2,4,7] with maximum absolute diff |2-7| = 5 &gt; 4.
+[4] with maximum absolute diff |4-4| = 0 &lt;= 4.
+[4,7] with maximum absolute diff |4-7| = 3 &lt;= 4.
+[7] with maximum absolute diff |7-7| = 0 &lt;= 4. 
+Therefore, the size of the longest subarray is 2.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [10,1,2,4,7,2], limit = 5
+<strong>Output:</strong> 4 
+<strong>Explanation:</strong> The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 &lt;= 5.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [4,2,2,2,4,4,2,2], limit = 0
+<strong>Output:</strong> 3
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>0 &lt;= limit &lt;= 10<sup>9</sup></code></li>
+</ul>

Solutions/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/solution.py

@@ -0,0 +1,33 @@
+class Solution:
+    def longestSubarray(self, nums: List[int], limit: int) -> int:
+        # sorted_list = SortedList()
+        # result = j = 0
+        # for i, val in enumerate(nums):
+        #     sorted_list.add(val)
+        #     while sorted_list[-1] - sorted_list[0] > limit:
+        #         sorted_list.remove(nums[j])
+        #         j += 1
+        #     result = max(result, i - j + 1)
+        # return result
+
+        min_queue = Deque()
+        max_queue = Deque()
+        left = 0
+        n = len(nums)
+        for right, val in enumerate(nums):
+            while max_queue and nums[max_queue[-1]] < val:
+                max_queue.pop()
+            while min_queue and nums[min_queue[-1]] > val:
+                min_queue.pop()
+
+            min_queue.append(right)
+            max_queue.append(right)
+
+            if nums[max_queue[0]] - nums[min_queue[0]] > limit:
+                left += 1
+                if max_queue[0] < left:
+                    max_queue.popleft()
+                if min_queue[0] < left:
+                    min_queue.popleft()
+
+        return n - left