题解 | #子数组的最大累加和问题# O（1）
子数组的最大累加和问题
http://www.nowcoder.com/practice/554aa508dd5d4fefbf0f86e5fe953abd
#
# max sum of the subarray
# @param arr int整型一维数组 the array
# @return int整型
#
class Solution:
def maxsumofSubarray(self , arr ):
# write code here
dp = arr[0]
maxSum = dp
i = 1
while i<len(arr):
dp = max(0,dp) + arr[i]
maxSum = max(dp, maxSum)
i+=1
return maxSum 
查看26道真题和解析
华为HUAWEI工作强度 1372人发布