L = [-2,11,-4,-13,5,-2]
sum = 0
max = 0
for i in range(len(L)):
sum = sum + L[i]
if sum > max:
max = sum
elif sum<0:
sum = 0
print max
求最大子序列的线性算法
最新推荐文章于 2022-01-05 23:49:16 发布
L = [-2,11,-4,-13,5,-2]
sum = 0
max = 0
for i in range(len(L)):
sum = sum + L[i]
if sum > max:
max = sum
elif sum<0:
sum = 0
print max