aboutsummaryrefslogtreecommitdiff
path: root/count_hidden_sequences.py
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-04-20 19:06:52 -0600
committerJack Sangdahl <[email protected]>2025-04-20 19:06:52 -0600
commitebb9933e94bf1beacf487b8a3f1915a0ba92edbc (patch)
treea10aa39ee832311cb20d60989934129b8c529456 /count_hidden_sequences.py
parentfef03eaef98cc479f58c4e1dd4619db665f97e8f (diff)
downloadleetcode-ebb9933e94bf1beacf487b8a3f1915a0ba92edbc.tar.gz
leetcode-ebb9933e94bf1beacf487b8a3f1915a0ba92edbc.zip
2145. count the hidden sequences
Diffstat (limited to 'count_hidden_sequences.py')
-rw-r--r--count_hidden_sequences.py30
1 files changed, 30 insertions, 0 deletions
diff --git a/count_hidden_sequences.py b/count_hidden_sequences.py
new file mode 100644
index 0000000..c229f7a
--- /dev/null
+++ b/count_hidden_sequences.py
@@ -0,0 +1,30 @@
+# 2145. Count the Hidden Sequences
+from itertools import accumulate
+
+"""
+you are given a 0-indexed array of 'n' integers 'differences', which
+describes the differences between each pair of consecutive integers of a
+hidden sequence of length '(n + 1)'. you are further given two integers
+'lower' and 'upper' that describe the inclusive range of values '[lower,
+upper]' that the hidden sequence can contain. return the number of possible
+hidden sequences there are. if there are no possible sequences, return 0.
+"""
+
+
+class Solution(object):
+ def numberOfcntrrays(self, differences, lower, upper):
+ """
+ :type differences: List[int]
+ :type lower: int
+ :type upper: int
+ :rtype: int
+ """
+ cnt = list(accumulate(differences, initial=0))
+ return max(0, (upper - lower) - (max(cnt) - min(cnt)) + 1)
+
+
+if __name__ == "__main__":
+ obj = Solution()
+ print(obj.numberOfcntrrays(differences=[1, -3, 4], lower=1, upper=6))
+ print(obj.numberOfcntrrays(differences=[3, -4, 5, 1, -2], lower=-4, upper=5))
+ print(obj.numberOfcntrrays(differences=[4, -7, 2], lower=3, upper=6))