Package g0901_1000.s0930_binary_subarrays_with_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    930 - Binary Subarrays With Sum.

    Medium

    Given a binary array nums and an integer goal, return the number of non-empty subarrays with a sum goal.

    A subarray is a contiguous part of the array.

    Example 1:

    Input: nums = 1,0,1,0,1, goal = 2

    Output: 4

    Explanation: The 4 subarrays are bolded and underlined below:

    <ins> **1,0,1** </ins>,0,1

    <ins> **1,0,1,0** </ins>,1

    1,<ins> **0,1,0,1** </ins>

    1,0,<ins> **1,0,1** </ins>

    Example 2:

    Input: nums = 0,0,0,0,0, goal = 0

    Output: 15

    Constraints:

    • <code>1 <= nums.length <= 3 * 10<sup>4</sup></code>

    • nums[i] is either 0 or 1.

    • 0 &lt;= goal &lt;= nums.length

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description