Number of Zero-Filled Subarrays LeetCode solution in JavaScript

1
/**
2
* @param {number[]} nums
3
* @return {number}
4
*/
5
var zeroFilledSubarray = function (nums) {
6
let numOfSubarray = 0;
7

8
for (let i = 0; i < nums.length; i++) {
9
if (nums[i] === 0) {
10
let j = i;
11
while (nums[j] === 0 && j < nums.length) {
12
j++;
13
}
14

15
numOfSubarray += ((j - i + 1) * (j - i)) / 2;
16
i = j;
17
}
18
}
19

20
return numOfSubarray;
21
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0