class Solution: def FindGreatestSumOfSubArray(self, array): if not array: return 0 rest = [] for i in range(len(array)): sum = array[i] rest.append(sum) for j in range(i+1,len(array)): sum += array[j] rest.append(sum) rest.sort() return rest[-1]
用户登录
还没有账号?立即注册
用户注册
投稿取消
文章分类: |
|
还能输入300字
上传中....