1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
// 2444. Count Subarrays With Fixed Bounds
#include "leetcode.h"
/*
* given an integer array 'nums' and two integer 'mink' and 'maxk'. a fixed
* bound subarray of 'nums' is a subarray that satisfies the following
* conditions. the minimum value in the subarray is equal to 'mink' and the
* maximum value in the subarray is equal to 'maxk'. return the number of fixed
* bound subarrays. a subarray is a contiguous part of an array.
*/
long long countSubarrays(int *nums, int numsSize, int minK, int maxK) {
long long ans = 0;
int bad = -1, prev_min = -1, prev_max = -1;
for (int i = 0; i < numsSize; ++i) {
if (nums[i] < minK || nums[i] > maxK)
bad = i;
if (nums[i] == minK)
prev_min = i;
if (nums[i] == maxK)
prev_max = i;
ans += fmax(0L, fmin(prev_min, prev_max) - bad);
}
return ans;
}
int main() {
int n1[] = {1, 3, 5, 2, 7, 5}, n2[] = {1, 1, 1, 1};
printf("%lld\n", countSubarrays(n1, ARRAY_SIZE(n1), 1, 5)); // expect: 2
printf("%lld\n", countSubarrays(n2, ARRAY_SIZE(n2), 1, 1)); // expect: 10
}
|