aboutsummaryrefslogtreecommitdiff
path: root/ways_split_arr_subarr.py
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2024-07-23 16:22:13 -0600
committerJack Sangdahl <[email protected]>2024-07-23 16:22:13 -0600
commitc983d558ae8515af7b9d2e238f599bb82535aa7a (patch)
tree461b8a47f84e3f09f80684e9b9d3a0b871ee938e /ways_split_arr_subarr.py
parent498831056c55541ba7ca6f0548e900d463deaf97 (diff)
downloadleetcode-c983d558ae8515af7b9d2e238f599bb82535aa7a.tar.gz
leetcode-c983d558ae8515af7b9d2e238f599bb82535aa7a.zip
2750. ways to split array into good subarrays
Diffstat (limited to 'ways_split_arr_subarr.py')
-rw-r--r--ways_split_arr_subarr.py33
1 files changed, 33 insertions, 0 deletions
diff --git a/ways_split_arr_subarr.py b/ways_split_arr_subarr.py
new file mode 100644
index 0000000..df65591
--- /dev/null
+++ b/ways_split_arr_subarr.py
@@ -0,0 +1,33 @@
+# 2750. Ways to Split Array Into Good Subarrays
+
+"""
+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 10^9+7. a subarray is contiguous non empty sequence of
+elements within an array.
+"""
+
+
+class Solution(object):
+ def numberOfGoodSubarraySplits(self, nums):
+ """
+ :type nums: List[int]
+ :rtype: int
+ """
+ ans, lo = 0, -1
+ for hi, i in enumerate(nums):
+ if i == 1:
+ if ans == 0:
+ ans = 1
+ else:
+ ans *= hi - lo
+ ans %= 10**9 + 7
+ lo = hi
+ return ans
+
+
+if __name__ == "__main__":
+ obj = Solution()
+ print(obj.numberOfGoodSubarraySplits(nums=[0, 1, 0, 0, 1]))
+ print(obj.numberOfGoodSubarraySplits(nums=[0, 1, 0]))