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

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param array int整型一维数组 
# @return int整型一维数组
#
class Solution:
    def FindGreatestSumOfSubArray(self , array):
        dp=[-float('inf')]*len(array)
        dp[0]=array[0]
        tmp=[array[0]]
        maxarray=tmp.copy()
        maxsum=array[0]
        for i in range(1,len(array)):
            if dp[i-1]>=0:
                dp[i]=dp[i-1]+array[i]
                tmp.append(array[i])
            else:
                dp[i]=array[i]
                tmp=[array[i]]
            l=len(tmp)
            if dp[i]>maxsum or(dp[i]==maxsum and l>=len(maxarray)):
                maxarray=tmp.copy()
                maxsum=dp[i]
        return maxarray