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.py | |
parent | 6c5db50fce3a14a2205e7d927c8adaf829aa6280 (diff) | |
download | leetcode-933b3b41aa8f2286e7f2f846925b45c8df15282d.tar.gz leetcode-933b3b41aa8f2286e7f2f846925b45c8df15282d.zip |
2348. number of zero-filled subarrays
Diffstat (limited to 'num_zero_filled_subarr.py')
-rw-r--r-- | num_zero_filled_subarr.py | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/num_zero_filled_subarr.py b/num_zero_filled_subarr.py new file mode 100644 index 0000000..db8c3b5 --- /dev/null +++ b/num_zero_filled_subarr.py @@ -0,0 +1,29 @@ +# 2348. Number of Zero-Filled Subarrays + +""" +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 +""" + + +class Solution(object): + def zeroFilledSubarray(self, nums): + """ + :type nums: List[int] + :rtype: int + """ + cnt, streak = 0 + for i in nums: + if i == 0: + streak += 1 + cnt += streak + else: + streak = 0 + return cnt + + +if __name__ == "__main__": + obj = Solution() + print(obj.zeroFilledSubarray(nums=[1, 3, 0, 0, 2, 0, 0, 4])) + print(obj.zeroFilledSubarray(nums=[0, 0, 0, 2, 0, 0])) + print(obj.zeroFilledSubarray(nums=[2, 10, 2019])) |