【剑指offer】＜动态规划--简单＞【JZ42 连续子数组的最大和】

v1 – Error 忽略即可

v2 – 动态规划

class Solution:
    def FindGreatestSumOfSubArray(self , array: List[int]) -> int:
        nsum = -101
        ans = -101
        for i in array:
            if nsum < 0:
                nsum = i
            else:
                nsum = i+nsum
            ans = max(nsum, ans)
        return ans