class Solution(object):
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
maxSoFar = -float('inf')
maxEndingHere = 0
for num in nums:
maxEndingHere = max(maxEndingHere+num, num)
maxSoFar = max(maxSoFar, maxEndingHere)
return maxSoFar
https://leetcode.com/problems/maximum-subarray/
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
.