C# 代码
public class Solution {
public int NumberOfGoodSubarraySplits(int[] nums) {
int n = nums.Length, mod = 1000000007;
long prod = 1, pre = -1;
for (int i = 0; i < n; i++){
if (nums[i] == 1){
if (pre >= 0){
prod = (prod * (i - pre)) % mod;
}
pre = i;
}
}
return pre == -1 ? 0 : (int)prod;
}
}