Maximum Subarray [最大子数组]

最新推荐文章于 2026-01-05 22:36:07 发布

原创最新推荐文章于 2026-01-05 22:36:07 发布 · 585 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #dp

LeetCode 专栏收录该内容

111 篇文章

订阅专栏

本文介绍了一种算法来查找给定数组中和最大的连续子数组，并提供了实例演示和代码实现。

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 {
    public int maxSubArray(int[] A) {
        if(A.length==0) return 0;
        if(A.length==1) return A[0];
        int start=A[A.length-1];
        int maxSum=A[A.length-1];
        for(int i=A.length-2;i>=0;i--){
            start=Math.max(A[i],start+A[i]);
            maxSum=Math.max(maxSum,start);
        }
        return maxSum;
    }
}

思路:dp