LeetCode53.最大子序和maxSubArray

1、题目描述

https://leetcode-cn.com/problems/maximum-subarray/

给定一个整数数组 nums ，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。

输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大，为 6。

进阶: 如果你已经实现复杂度为 O(n) 的解法，尝试使用更为精妙的分治法求解。

2、代码详解

Python

开辟新数组dp[i]，时间复杂度O(N)，遍历一遍数组

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        dp = [0] * n  # dp = [0 for i in range(n)]
        dp[0] = nums[0]
        max_sum = dp[0]

        for i in range(1, n):
            dp[i] = nums[i] + (dp[i-1] if dp[i-1] > 0 else 0)  # java dp[i-1]>0 ? dp[i-1] : 0
            # dp[i] = max(nums[i], dp[i-1] + nums[i])  # 写法2
            max_sum = max(max_sum, dp[i])
        print(dp)
        return max_sum

nums = [-2,1,-3,4,-1,2,1,-5,4]
s = Solution()
print(s.maxSubArray(nums))

不使用额外空间

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

        return max_sum

Java

public class maxSubArray53 {
    public static void main(String[] args){
        int[] nums = {-2,1,-3,4,-1,2,1,-5,4};
        System.out.println(maxSubArray(nums));

    }
    public static int maxSubArray(int[] nums){
        int n = nums.length;
        int[] dp = new int[n]; // dp[i]记录nums[i]之前的最大子序和
        dp[0] = nums[0];
        int max = dp[0];

        for(int i = 1; i < n; i++){
            dp[i] = nums[i] + (dp[i-1] > 0 ? dp[i-1] : 0);
            max = Math.max(max, dp[i]);
        }
        return max;

    }

}

https://www.bilibili.com/video/av38722679?from=search&seid=325152201807562319