LeetCode-53 Maximum Subarray

Description

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

Example

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Submissions

求连续子数组的最大和,解题思路采用动态规划.首先初始化sum和res大小为数组的第一个元素,sum代表当前连续子数组的和,res代表连续子数组的最大和.然后遍历nums数组,首先判断sum大小,如果大于零则继续加上nums[i],如果小于零,则代表与nums[i]相加不能得到更大和,所以令sum等于nums[i],去寻找下一个连续子数组.最后比较令res等于res和sum的最大值,即为连续子数组的最大和,并返回结果.

实现代码如下:

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        if not nums:
            return None
        sum = res =  nums[0]
        for i in range(1, len(nums)):
            if sum>0:
                sum += nums[i]  
            else:
                sum = nums[i]
            res = max(res, sum)
        return res