8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 950e83c commit 615d843Copy full SHA for 615d843
December 2024 Leetcode Solution/December-14.py
@@ -0,0 +1,24 @@
1
+from collections import deque
2
+from typing import List
3
+
4
+class Solution:
5
+ def continuousSubarrays(self, nums: List[int]) -> int:
6
+ start = 0
7
+ total_subarrays = 0
8
+ max_deque, min_deque = deque(), deque()
9
+ for end, num in enumerate(nums):
10
+ while max_deque and nums[max_deque[-1]] <= num:
11
+ max_deque.pop()
12
+ max_deque.append(end)
13
+ while min_deque and nums[min_deque[-1]] >= num:
14
+ min_deque.pop()
15
+ min_deque.append(end)
16
+ while nums[max_deque[0]] - nums[min_deque[0]] > 2:
17
+ if max_deque[0] == start:
18
+ max_deque.popleft()
19
+ if min_deque[0] == start:
20
+ min_deque.popleft()
21
+ start += 1
22
+ total_subarrays += end - start + 1
23
24
+ return total_subarrays
0 commit comments