diff options
author | Jack Sangdahl <[email protected]> | 2025-08-18 21:36:14 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-08-18 21:36:14 -0600 |
commit | 933b3b41aa8f2286e7f2f846925b45c8df15282d (patch) | |
tree | 252d6005e8117e2efa2077096c3a47e009f6d018 /num_zero_filled_subarr.c | |
parent | 6c5db50fce3a14a2205e7d927c8adaf829aa6280 (diff) | |
download | leetcode-933b3b41aa8f2286e7f2f846925b45c8df15282d.tar.gz leetcode-933b3b41aa8f2286e7f2f846925b45c8df15282d.zip |
2348. number of zero-filled subarrays
Diffstat (limited to 'num_zero_filled_subarr.c')
-rw-r--r-- | num_zero_filled_subarr.c | 18 |
1 files changed, 10 insertions, 8 deletions
diff --git a/num_zero_filled_subarr.c b/num_zero_filled_subarr.c index b8fd33d..8b7e23e 100644 --- a/num_zero_filled_subarr.c +++ b/num_zero_filled_subarr.c @@ -1,17 +1,19 @@ // 2348. Number of Zero-Filled Subarrays -#include <stdio.h> +#include "leetcode.h" // given integer array 'nums', return number of subarrays filled with zero. a // subarray is a contiguous non-empty sequence of elements from within an array -long long zeroFilledSubarray(int *nums, int nums_size) { - long long ans = 0; - for (int i = 0, j = 0; i < nums_size; ++i) { - if (nums[i] != 0) - j = i + 1; - ans += i - j + 1; +long long zeroFilledSubarray(int *nums, int numsSize) { + long long cnt = 0, streak = 0; + for (int i = 0; i < numsSize; i++) { + if (!nums[i]) { + streak++; + cnt += streak; + } else + streak = 0; } - return ans; + return cnt; } int main() { |