minimum_size_subarray_sum.py

importsys


defminimum_subarray_sum(target: int, numbers: list[int]) ->int:
"""
 Return the length of the shortest contiguous subarray in a list of numbers whose sum
 is at least target. Reference: https://stackoverflow.com/questions/8269916

 >>> minimum_subarray_sum(7, [2, 3, 1, 2, 4, 3])
 2
 >>> minimum_subarray_sum(7, [2, 3, -1, 2, 4, -3])
 4
 >>> minimum_subarray_sum(11, [1, 1, 1, 1, 1, 1, 1, 1])
 0
 >>> minimum_subarray_sum(10, [1, 2, 3, 4, 5, 6, 7])
 2
 >>> minimum_subarray_sum(5, [1, 1, 1, 1, 1, 5])
 1
 >>> minimum_subarray_sum(0, [])
 0
 >>> minimum_subarray_sum(0, [1, 2, 3])
 1
 >>> minimum_subarray_sum(10, [10, 20, 30])
 1
 >>> minimum_subarray_sum(7, [1, 1, 1, 1, 1, 1, 10])
 1
 >>> minimum_subarray_sum(6, [])
 0
 >>> minimum_subarray_sum(2, [1, 2, 3])
 1
 >>> minimum_subarray_sum(-6, [])
 0
 >>> minimum_subarray_sum(-6, [3, 4, 5])
 1
 >>> minimum_subarray_sum(8, None)
 0
 >>> minimum_subarray_sum(2, "ABC")
 Traceback (most recent call last):
 ...
 ValueError: numbers must be an iterable of integers
 """
ifnotnumbers:
return0
iftarget==0andtargetinnumbers:
return0
ifnotisinstance(numbers, (list, tuple)) ornotall(
isinstance(number, int) fornumberinnumbers
 ):
raiseValueError("numbers must be an iterable of integers")

left=right=curr_sum=0
min_len=sys.maxsize

whileright<len(numbers):
curr_sum+=numbers[right]
whilecurr_sum>=targetandleft<=right:
min_len=min(min_len, right-left+1)
curr_sum-=numbers[left]
left+=1
right+=1

return0ifmin_len==sys.maxsizeelsemin_len