题目描述:
代码:
#采用动态规划的思想
class Solution(object):
def maxSubArray(self, nums):
for i in range(1,len(nums)):
nums[i]+=max(nums[i-1],0)
return max(nums)
题目描述:
代码:
#采用动态规划的思想
class Solution(object):
def maxSubArray(self, nums):
for i in range(1,len(nums)):
nums[i]+=max(nums[i-1],0)
return max(nums)