Leetcode - Maximum Subarray

iteye_17352

于 2015-04-15 09:43:25 发布

阅读量85

点赞数

CC 4.0 BY-SA版权

分类专栏： Dynamic Programming

本文链接：https://blog.youkuaiyun.com/iteye_17352/article/details/82617702

Dynamic Programming 专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一个算法来找到数组中具有最大和的连续子数组，通过动态规划实现，详细解释了算法原理和步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

public class Solution {
    // dp[i] = max(A[i], dp[i - 1] + A[i])
    public int maxSubArray(int[] A) {
        if (A == null || A.length == 0)
            return 0;
        int[] dp = new int[A.length];
        dp[0] = A[0];
        int max = dp[0];
        for (int i = 1; i < A.length; i++) {
            dp[i] = Math.max(A[i], A[i] + dp[i - 1]);
            if (dp[i] > max)
                max = dp[i];
        }
        return max;
    }
}