6min
特殊例子 吉捶，全為負(fù)數(shù)
# -*- coding:utf-8 -*-
class Solution:
def FindGreatestSumOfSubArray(self, array):
# write code here
result=array[0] #注意特殊情況全為負(fù)數(shù)
cur=0
for i in array:
cur=max(i,i+cur)
result=max(cur,result)
return result
