AlgoMaster Logo

Number of Zero-Filled Subarrays

nums=[1, 0, 0, 2, 0, 0, 0, 3, 0, 0]
1public long zeroFilledSubarray(int[] nums) {
2    long result = 0;
3    int zeroCount = 0;
4
5    for (int num : nums) {
6        if (num == 0) {
7            zeroCount++;
8        } else {
9            result += zeroCount * (zeroCount + 1L) / 2;
10            zeroCount = 0;
11        }
12    }
13
14    result += zeroCount * (zeroCount + 1L) / 2;
15
16    return result;
17}
0 / 25
10010223040506370809zeroCount = 0result = 0