最大子列和问题(三种简单算法)
给定K个整数组成的序列{ N1, N2, ..., NK },“连续子列”被定义为{ Ni, Ni+1, ..., Nj },其中 1。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 },其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序,计算给定整数序列的最大子列和。
#算法一 / O(N3):
def Zuidaziliehe(list1,N):
Maxsum = 0
for i in range(0,N):
for j in range(i,N):
Thissum=0
for k in range(i,j+1):
Thissum += list1[k]
if Thissum > Maxsum:
Maxsum = Thissum
return Maxsum
#算法二 / O(N2):
def Zuidaziliehe(list1,N):
Maxsum = 0
for i in range(0,N):
Thissum=0
for j in range(i,N):
Thissum += list1[j]
if Thissum > Maxsum:
Maxsum = Thissum
return Maxsum
#算法三 / O(N):
def Zuidaziliehe(list1,N):
Maxsum = 0
for i in range(0,N):
Thissum += list1[i]
if Thissum > Maxsum:
Maxsum = Thissum
elif Thissum<0:
Thissum = 0
return Maxsum
A=Zuidaziliehe([-2,11,-4,26,-5,-2,7,-8,9,-6,7,4,5,5],14)
print('最大子序列和为:',A)