You are given a binary array nums.

A subarray is defined as good if it contains exactly one element equal to $1$.

A split of the array is valid if nums is partitioned into one or more contiguous non-empty subarrays where every subarray is good.

Return the total number of ways to split nums into good subarrays. Since the answer can be large, return it modulo $10^9 + 7$. If there are no valid splits, return $0$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.