问题:
给一组整数 输出其中最大的连续排列整数之和
例如:1 2 -1 3 4 10 10 -10 -1
则 1 2 -1 3 4 10 10 为和最大的连续排列的整数
def large_cont_sum(arr):
if len(arr) == 0:
return 0
count = [arr[0]]
list1 = []
max_sum = arr[0]
current_sum = arr[0]
for num in arr[1:]:
current_sum = max(current_sum+num,num)
count.append(current_sum)
#print("current_sum:",current_sum)
max_sum = max(max_sum,current_sum)
#print("max_sum:",max_sum)
#print()
index = count.index(max(count))
list1 = arr[:index+1]
return max_sum, list1
arr = [1,2,-1,3,4,10,10,-10,-1]
large_cont_sum(arr)
(29, [1, 2, -1, 3, 4, 10, 10])