#动态规划 若前面子数组的和小于0,则从当前数字开始累加
lists = [1, -2, 3, 10, -4, 7, 2, -5]
m = 0
m_d = 0
for i in lists:
m += i
m = max(m,0)
m_d = max(m,m_d)
print(m_d)
连续子数组的最大和--python
最新推荐文章于 2020-12-08 08:24:25 发布
#动态规划 若前面子数组的和小于0,则从当前数字开始累加
lists = [1, -2, 3, 10, -4, 7, 2, -5]
m = 0
m_d = 0
for i in lists:
m += i
m = max(m,0)
m_d = max(m,m_d)
print(m_d)