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

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