53. Maximum Subarray (Easy) - TengnanYao/daily_leetcode GitHub Wiki

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        for i in range(len(nums) - 1):
            nums[i + 1] = max(nums[i] + nums[i + 1], nums[i + 1])
        return max(nums)
        
        # curSum = maxSum = nums[0]
        # for val in nums[1 : ]:
        #     curSum = max(val, curSum + val)
        #     maxSum = max(maxSum, curSum)
        # return maxSum