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

class Solution:
    def FindGreatestSumOfSubArray(self, array):
        size=len(array)
        if size==1:
            return array[0]
        else:
            for i in range(1,size):
                array[i]+=max(array[i-1],0)
        return max(array)