[leetcode DP]53. 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.

 class Solution(object):
     def maxSubArray(self, nums):
         thissum,maxsum = 0,-9999999999999
         for v in nums:
             thissum += v
             if thissum>maxsum:
                 maxsum = thissum
             if thissum<0:
                 thissum = 0
         return maxsum

 class Solution(object):
     def maxSubArray(self, nums):
         thissum=maxsum = nums[0]
         for v in nums[1:]:
             thissum = max(v,v+thissum)
             maxsum = max(maxsum,thissum)
         return maxsum