Maximum Subarray

最新推荐文章于 2025-05-15 16:32:28 发布

原创最新推荐文章于 2025-05-15 16:32:28 发布 · 567 阅读

0 ·

CC 4.0 BY-SA版权

面试题专栏收录该内容

48 篇文章

订阅专栏

本文介绍如何在给定的整数数组中找到具有最大和的连续子数组，通过实现一个高效的算法来解决这个问题。

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.

click to show more practice.

More practice:

public int maxSubArray(int[] A) {
    if (A == null || A.length == 0) {
        return 0;
    }
    
    int sum = 0;
    int max = Integer.MIN_VALUE;
    for (int i = 0; i < A.length; i++) {
        if (sum + A[i] < A[i]) {
            sum = A[i];
        } else {
            sum += A[i];
        }
        
        if (sum > max) {
            max = sum;
        }
    }        
    
    return max;
}