题解 | 连续子数组的最大和

#

# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param array int整型一维数组 
# @return int整型
#
class Solution:
    def FindGreatestSumOfSubArray(self , array: List[int]) -> int:
        # write code here
        dp = [0 for i in range(len(array))]
        dp[0],maxsum  = array[0],array[0]
        for i in range(1,len(array)):
            dp[i] = max(dp[i-1]+array[i],array[i])
            maxsum = max(maxsum, dp[i])
        return maxsum