def s(arry):
tem = 0
res = arry[0]
//n =[]
for i in range(len(arry)):
if tem+arry[i] <0:
tem = 0
else:
tem += arry[i]
// n.append(arry[i])
res = max(res,tem)
// print(n)
print(res)
s([1,-2,3,10,-4,7,2,-5])
leetcode -最大连续子数组的和
最新推荐文章于 2023-09-13 10:15:53 发布