LeetCode-maximum-subarray

最新推荐文章于 2024-05-06 23:09:19 发布

原创最新推荐文章于 2024-05-06 23:09:19 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#maximum-subarray #LeetCode

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种在数组中寻找连续子数组并求其最大和的高效算法。以[-2,1,-3,4,-1,2,1,-5,4]为例，连续子数组[4,-1,2,1]的和最大为6。文章提供了O(n)复杂度的解决方案，并鼓励读者尝试使用更复杂的分治法。

摘要生成于 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.

click to show more practice.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

public class Solution {
    public int maxSubArray(int[] A) {
        int n = A.length;
        if(n == 0)
            return 0;
        if(n == 1)
            return A[0];
        int sum_cur = A[0];
        int max_sum = A[0];
        for(int i = 1; i<n ;i++){
            if(sum_cur<0)
                sum_cur = A[i];
            else
                sum_cur += A[i];
            if(sum_cur > max_sum)
                max_sum = sum_cur;
        }
        return max_sum;
    }
}