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

class Solution:
    def FindGreatestSumOfSubArray(self, array: List[int]) -> List[int]:
        # write code here
        dp = [0 for i in range(len(array))]
        dp[0] = array[0]
        maxsum = dp[0]
        # 滑动区间
        left = 0
        right = 0
        # 记录最长的区间
        resl = 0
        resr = 0
        for i in range(1,len(array)):
            if dp[i-1]+array[i]>=array[i]:
                dp[i] = dp[i-1]+array[i]
                right = i
                thissum = dp[i]
                if thissum>=maxsum:
                    maxsum = thissum
                    if right-left>resr-resl:
                        resl = left
                        resr = right
            else:
                dp[i] = array[i]
                left = i
                right = i
                thissum = dp[i]
                if thissum>maxsum:
                    maxsum = thissum
                    resl = left
                    resr = right
                elif thissum==maxsum:
                    if right-left>resr-resl:
                        resl = left
                        resr = right
        
        return array[resl:resr+1]