LeetCode重点题系列之【53. Maximum Subarray】

最新推荐文章于 2024-07-06 16:39:49 发布

肖冬禹想要拿OFFER

最新推荐文章于 2024-07-06 16:39:49 发布

阅读量232

点赞数

分类专栏： LeetCode重点题

本文链接：https://blog.csdn.net/ASDJHO/article/details/89179749

版权

LeetCode重点题专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

Example:

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

class Solution(object):
    def maxSubArray(self,nums):
        mem=[0 for _ in range(len(nums))]
        mem[0]=nums[0]
        maximal=nums[0]
        for i in range(1,len(nums)):
            mem[i]=max(mem[i-1]+nums[i],nums[i])
            maximal=max(maximal,mem[i])
        return maximal