# -*- coding:utf-8 -*-
class Solution:
def FindGreatestSumOfSubArray(self, array):
# write code here
dp = [i for i in array]
for i in range(1,len(array)):
dp[i] = max(dp[i-1]+array[i],array[i])
return max(dp) 
京公网安备 11010502036488号