Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [-2,1,-3,4,-1,2,1,-5,4]
,
the contiguous subarray [4,-1,2,1]
has the largest sum = 6
.
翻译:找到和最大的连续子序列
class Solution(object):
def maxSubArray(self, nums):
cnt = len(nums)
currentSum = 0
MaxSum = nums[0]
for i in range(cnt):
currentSum+=nums[i]
if currentSum>MaxSum:
MaxSum = currentSum
if currentSum <0:
currentSum = 0
return MaxSum