Skip to content

Commit 9e22d75

Browse files
authored
Create 2444. Count Subarrays With Fixed Bounds
1 parent de98059 commit 9e22d75

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed
+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
class Solution {
2+
public:
3+
long long countSubarrays(vector<int>& nums, int minK, int maxK) {
4+
long long ans = 0;
5+
int j = -1;
6+
int prevMinKIndex = -1;
7+
int prevMaxKIndex = -1;
8+
9+
for (int i = 0; i < nums.size(); ++i) {
10+
if (nums[i] < minK || nums[i] > maxK)
11+
j = i;
12+
if (nums[i] == minK)
13+
prevMinKIndex = i;
14+
if (nums[i] == maxK)
15+
prevMaxKIndex = i;
16+
ans += max(0, min(prevMinKIndex, prevMaxKIndex) - j);
17+
}
18+
19+
return ans;
20+
}
21+
};

0 commit comments

Comments
 (0)