tvl-depot/users/wpcarro/scratch/facebook/largest-contiguous-sum.py
Vincent Ambo 019f8fd211 subtree(users/wpcarro): docking briefcase at '24f5a642'
git-subtree-dir: users/wpcarro
git-subtree-mainline: 464bbcb15c
git-subtree-split: 24f5a642af
Change-Id: I6105b3762b79126b3488359c95978cadb3efa789
2021-12-14 02:15:47 +03:00

15 lines
290 B
Python

def find_sum(xs):
result = float('-inf')
streak = 0
for x in xs:
result = max(result, streak, x)
if streak + x <= 0:
streak = x
else:
streak += x
return result
x = [2,-8,3,-2,4,-10]
assert find_sum(x) == 5
print("Success!")