53. Maximum Subarray -Easy

最新推荐文章于 2021-05-14 18:50:44 发布

Euadvancer

最新推荐文章于 2021-05-14 18:50:44 发布

阅读量296

点赞数

分类专栏： LeetCode-动态规划文章标签： python leetcode 动态规划

本文链接：https://blog.csdn.net/Euadvancer/article/details/55004867

版权

LeetCode-动态规划专栏收录该内容

38 篇文章 0 订阅

订阅专栏

Question

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

找到一个元素总和最大的连续子数组（包含至少一个数字）

Example

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.

Solution

动态规划解。定义dp[i]：以第i个元素结尾的连续子数组的最大总和。递推式：dp[i] = max(dp[i - 1] + nums[i], nums[i])，即比较它加上前面的最大总和和它本身，取较大者。额外维护一个res记录最大总和即可。

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 0: return 0
        dp = [0] * len(nums)
        dp[0] = nums[0]
        res = nums[0]  # 维护最大总和
        for index_n in range(1, len(nums)):
            dp[index_n] = max(dp[index_n - 1] + nums[index_n], nums[index_n])
            res = max(res, dp[index_n])
        return res