Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2348 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2348 # by problem number
lcpy gen -s number_of_zero_filled_subarrays # by problem name
Input: nums = [1,3,0,0,2,0,0,4]
Output: 6
Explanation:
There are 4 occurrences of [0] as a subarray.
There are 2 occurrences of [0,0] as a subarray.
There is no occurrence of a subarray with a size more than 2 filled with 0. Therefore, we return 6.
Input: nums = [0,0,0,2,0,0]
Output: 9
Explanation:
There are 5 occurrences of [0] as a subarray.
There are 3 occurrences of [0,0] as a subarray.
There is 1 occurrence of [0,0,0] as a subarray.
There is no occurrence of a subarray with a size more than 3 filled with 0. Therefore, we return 9.
Input: nums = [2,10,2019]
Output: 0
Explanation: There is no subarray filled with 0. Therefore, we return 0.
class Solution:
# Time: O(n)
# Space: O(1)
def zero_filled_subarray(self, nums: list[int]) -> int:
total = 0
streak = 0
for num in nums:
streak = streak + 1 if num == 0 else 0
total += streak
return total
| Time | Space |
|---|---|
| O(n) | O(1) |