leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

num_zero_filled_subarr.c (753B)

 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
// 2348. Number of Zero-Filled Subarrays
#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 numsSize) {
  long long cnt = 0, streak = 0;
  for (int i = 0; i < numsSize; i++) {
    if (!nums[i]) {
      streak++;
      cnt += streak;
    } else
      streak = 0;
  }
  return cnt;
}

int main() {
  int n1[] = {1, 3, 0, 0, 2, 0, 0, 4};
  int n2[] = {0, 0, 0, 2, 0, 0};
  int n3[] = {2, 10, 2019};
  printf("%lld\n", zeroFilledSubarray(n1, 8)); // expect: 6
  printf("%lld\n", zeroFilledSubarray(n2, 6)); // expect: 9
  printf("%lld\n", zeroFilledSubarray(n3, 3)); // expect: 0
}