LeetCode刷题【Array】 Maximum Subarray

最新推荐文章于 2022-07-14 19:35:25 发布

SimonCode

最新推荐文章于 2022-07-14 19:35:25 发布

阅读量231

点赞数

分类专栏： LeetCode 文章标签： Array leetcode

本文链接：https://blog.csdn.net/ltxiaoxia/article/details/62425182

版权

LeetCode 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

题目：

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

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.

解决方法一： Runtime: 18 ms

public class Solution {
    public int maxSubArray(int[] nums) {
        int maxSum=nums[0];
        int currSum=0;
        for(int i=0;i<nums.length;i++){
            currSum+=nums[i];
            if(maxSum<currSum) maxSum=currSum;
            if(currSum<0) currSum=0;
        }
        return maxSum;
    }
}

解决方法二：DP 方法：

maxSubArray(A, i) = maxSubArray(A, i - 1) > 0 ? maxSubArray(A, i - 1)+A[i]: 0 + A[i];

public class Solution {
    public int maxSubArray(int[] nums) {
        int dp[] = new int[nums.length];
        dp[0]=nums[0];
        int max=nums[0];
        for(int i=1;i<nums.length;i++){
            dp[i]=nums[i]+(dp[i-1]>0 ? dp[i-1]:0);
            max=Math.max(max,dp[i]);
        }
        return max;
    }
}

参考：

【1】https://leetcode.com/