题解 | #连续子数组的最大和#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
# -*- 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) 
，别管自己的能力行不行了。