题解 | #子数组的最大累加和问题#

#
# max sum of the subarray
# @param arr int整型一维数组 the array
# @return int整型
#
class Solution:
    def maxsumofSubarray(self , arr ):
        # write code here
        dp = [0]*len(arr)
        dp[0] = arr[0]
        i = 1
        while i<len(arr):
            dp[i] = max(0,dp[i-1]) + arr[i]
            i+=1
        return max(dp)