刚开始想到用动态规划,每个数作为开始挨个算。代码如下,刚开始用python,代码有点不规范
def maxList(nums,data):
max = 0
for i in range(0,nums):
max1=0
j = i+1
k = 1
res = [0] * nums
res[0] = data[i]
while k<nums:
if j==nums:
j=0
if res[k-1]>0:
res[k] = res[k-1] + data[j]
else:
res[k] = data[j]
if res[k]>max1:
max1=res[k]
j+=1
k+=1
if max1>max:
max=max1
return max
结果超出时间限制,最简单的想法应该是数组如果循环的话,结果要么是从1到n的序列连续最大值,要么是数组的总和减去序列中间负数和的最大值,理解的话应该是选择最大和子序列的时候,把负数和最大的部分数排在一起。最大值和负数最大和都可以用动态规划来求,时间复杂度降到O(n)。
def maxList1(nums,data):
max1 = 0
res = [0] * nums
res[0] = data[0]
for i in range(1,nums):
if res[i-1]>0:
res[i] = res[i-1]+data[i]
else:
res[i] = data[i]
if res[i]>max1:
max1 = res[i]
min1 = 0
for i in range(1,nums):
if res[i-1]<0:
res[i] = res[i-1]+data[i]
else:
res[i] = data[i]
if res[i]<min1:
min1 = res[i]
return max(max1,sum(data)-min1)