题目描述:
给一个数组,返回它的最大连续子序列的和
思路:
有个最优子结构性质:DP[i] = max{DP[i-1] + A[i],A[i]}。能第一眼看出还是有些本事。
代码:
# -*- coding:utf-8 -*-
class Solution:
def FindGreatestSumOfSubArray(self, array):
# write code here
res =max(array)
temp = 0
for i in array:
temp = max(i,temp+i)
res = max(res,temp)
return res