NC19-子数组的最大累加和问题

# max sum of the subarray
# @param arr int整型一维数组 the array
# @return int整型
#
class Solution:
    def maxsumofSubarray(self , arr ):
        # write code here
        list = [[] for i in range(0,len(arr))]
        list[0] = arr[0]
        for i in range(1,len(arr)):
            if list[i-1] > 0:
                list[i] = list[i-1] + arr[i]
            else:
                list[i] = arr[i]
        return max(list)