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:
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
curNum = 0
maxNum = -2**31
for i in range(len(nums)):
if curNum < 0:
curNum = 0
curNum += nums[i]
maxNum = max(curNum, maxNum)
return maxNum