Update dynamic_programming/minimum_size_subarray_sum.py

rohan472000 · cclauss · web-flow · commit 57e5e37b2005 · 2023-04-01T19:48:57.000+05:30
Co-authored-by: Christian Clauss &lt;cclauss@me.com&gt;
diff --git a/dynamic_programming/minimum_size_subarray_sum.py b/dynamic_programming/minimum_size_subarray_sum.py
@@ -1,7 +1,7 @@
 def minsubarraysum(target: int, numbers: list[int]) -> int:
     """
     Returns the length of the shortest contiguous subarray
-     in nums whose sum is at least target.
+     in a list of numbers whose sum is at least target.
 
         >>> minsubarraysum(7, [2, 3, 1, 2, 4, 3])
         2

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`def minsubarraysum(target: int, numbers: list[int]) -> int:`
`2`	`2`	`"""`
`3`	`3`	`Returns the length of the shortest contiguous subarray`
`4`		`- in nums whose sum is at least target.`
	`4`	`+ in a list of numbers whose sum is at least target.`
`5`	`5`
`6`	`6`	`>>> minsubarraysum(7, [2, 3, 1, 2, 4, 3])`
`7`	`7`	`2`