From c8dfd03864b524280c0c3c745e6a7c428b6bfe5b Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Sun, 27 Apr 2025 23:59:37 -0600 Subject: 2302. count subarrays with score less than k --- count_subarr_score_less_k.c | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 count_subarr_score_less_k.c (limited to 'count_subarr_score_less_k.c') diff --git a/count_subarr_score_less_k.c b/count_subarr_score_less_k.c new file mode 100644 index 0000000..5c454d1 --- /dev/null +++ b/count_subarr_score_less_k.c @@ -0,0 +1,26 @@ +// 2302. Count Subarrays With Score Less Than K +#include "leetcode.h" + +/* + * the score of an array is defined as the product of its sum and its length. + * given a positive integer array 'nums' and an integer 'k', return the number + * of non-empty subarrays of 'nums' whose score is strictly less than 'k'. a + * subarray is a contiguous sequence of elements within an array. + */ + +long long countSubarrays(int *nums, int numsSize, long long k) { + long long ans = 0, curr = 0; + for (int j = 0, i = 0; j < numsSize; ++j) { + curr += nums[j]; + while (curr * (j - i + 1) >= k) + curr -= nums[i++]; + ans += j - i + 1; + } + return ans; +} + +int main() { + int n1[] = {2, 1, 4, 3, 5}, n2[] = {1, 1, 1}; + printf("%lld\n", countSubarrays(n1, ARRAY_SIZE(n1), 10)); // expect: 6 + printf("%lld\n", countSubarrays(n2, ARRAY_SIZE(n2), 5)); // expect: 5 +} -- cgit v1.2.3