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

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