[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 1:

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

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [0]
Output: 0

Example 4:

Input: nums = [-1]
Output: -1

Example 5:

Input: nums = [-2147483647]
Output: -2147483647

Constraints:

• 1 <= nums.length <= 2 * 104
• -231 <= nums[i] <= 231 - 1

分析

题目的意思是：找出数组中最长的连续子序列，这道题用贪心算法也能做。这次我选用了动态规划的方法，dp[i]表示长度为i的连续子序列的最大值，然后维护更新全局最大值res就行了。

代码

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

代码二

下面是一个更简单的贪心方法，拿当前的总和当前的值进行比较，如果比当前的值小，就直接舍弃，取当前的值。

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        cur_sum=0
        max_val=-2**31
        for i in range(len(nums)):
            cur_sum+=nums[i]
            if(nums[i]>cur_sum):
                cur_sum=nums[i]
            max_val=max(max_val,cur_sum)
        return max_val

参考文献

[LeetCode] solution