Package g2701_2800.s2750_ways_to_split_array_into_good_subarrays

Class Solution

java.lang.Object
g2701_2800.s2750_ways_to_split_array_into_good_subarrays.Solution
public class Solution extends java.lang.Object
2750 - Ways to Split Array Into Good Subarrays.

Medium

You are given a binary array nums.

A subarray of an array is good if it contains exactly one element with the value 1.

Return an integer denoting the number of ways to split the array nums into good subarrays. As the number may be too large, return it modulo 109 + 7.

A subarray is a contiguous non-empty sequence of elements within an array.

Example 1:

Input: nums = [0,1,0,0,1]

Output: 3

Explanation: There are 3 ways to split nums into good subarrays:

  • [0,1] [0,0,1]
  • [0,1,0] [0,1]
  • [0,1,0,0] [1]

Example 2:

Input: nums = [0,1,0]

Output: 1

Explanation: There is 1 way to split nums into good subarrays: - [0,1,0]

Constraints:

  • 1 <= nums.length <= 105
  • 0 <= nums[i] <= 1

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    numberOfGoodSubarraySplits(int[] nums)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • numberOfGoodSubarraySplits

      public int numberOfGoodSubarraySplits(int[] nums)