LeetCode | 53. Maximum Subarray | Easy | DP

Question

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.

Python Code

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        cumnum = maxnum = nums[0]
        for i in nums[1:]:
            cumnum = max(i,cumnum+i)
            maxnum = max(cumnum,maxnum)
        return maxnum

动态规划，拼多多数据分析面试的时候有遇到