mfocko/LeetCode
mfocko/LeetCode
1
0
Fork 0
Code Issues Pull requests Wiki Activity

cs: add «2444. Count Subarrays With Fixed Bounds»

Browse source 
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2024-03-31 16:36:42 +02:00
parent ec5319c3fb
commit a59eaa2eb4
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 28 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
cs/count-subarrays-with-fixed-bounds.cs Normal file
View file

@ -0,0 +1,28 @@
public class Solution {
public long CountSubarrays(int[] nums, int minK, int maxK) {
long count = 0;
var (minIdx, maxIdx) = (-1, -1);
for (int i = 0, j = 0; j < nums.Length; ++j) {
var x = nums[j];
// is not bounded
if (x < minK || x > maxK) {
i = j + 1;
continue;
}
if (x == minK) {
minIdx = j;
}
if (x == maxK) {
maxIdx = j;
}
count += Math.Max(0, Math.Min(minIdx, maxIdx) - i + 1);
}
return count;
}
}