2348. Number of Zero-Filled Subarrays LeetCode Solution
In this guide, you will get 2348. Number of Zero-Filled Subarrays LeetCode Solution with the best time and space complexity. The solution to Number of Zero-Filled Subarrays problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of Number of Zero-Filled Subarrays
Given an integer array nums, return the number of subarrays filled with 0.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1:
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.
Example 2:
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.
Example 3:
Input: nums = [2,10,2019]
Output: 0
Explanation: There is no subarray filled with 0. Therefore, we return 0.
Constraints:
1 <= nums.length <= 105
-109 <= nums[i] <= 109
Complexity Analysis
Time Complexity: O(n)
Space Complexity: O(1)
2348. Number of Zero-Filled Subarrays LeetCode Solution in C++
class Solution {
public:
long long zeroFilledSubarray(vector<int>& nums) {
long ans = 0;
int indexBeforeZero = -1;
for (int i = 0; i < nums.size(); ++i)
if (nums[i])
indexBeforeZero = i;
else
ans += i - indexBeforeZero;
return ans;
}
}; /* code provided by PROGIEZ */
2348. Number of Zero-Filled Subarrays LeetCode Solution in Java
class Solution {
public long zeroFilledSubarray(int[] nums) {
long ans = 0;
int indexBeforeZero = -1;
for (int i = 0; i < nums.length; ++i)
if (nums[i] == 0)
ans += i - indexBeforeZero;
else
indexBeforeZero = i;
return ans;
}
} // code provided by PROGIEZ
2348. Number of Zero-Filled Subarrays LeetCode Solution in Python
class Solution:
def zeroFilledSubarray(self, nums: list[int]) -> int:
ans = 0
indexBeforeZero = -1
for i, num in enumerate(nums):
if num:
indexBeforeZero = i
else:
ans += i - indexBeforeZero
return ans # code by PROGIEZ
