[Leetcode 53, medium] Maximal subarray

simplify2012

于 2015-03-22 03:54:47 发布

阅读量381

点赞数

分类专栏： Leetcode_medium 文章标签： c++ leetcode

本文链接：https://blog.youkuaiyun.com/u012212811/article/details/44533317

版权

Leetcode_medium 专栏收录该内容

99 篇文章

订阅专栏

本文探讨如何在数组中找到具有最大和的连续子数组，通过实例展示算法实现及优化。

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

Problem:

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.

Analysis:

Solutions:

C++:

    int maxSubArray(int A[], int n) {
        int max_sum = 0;
        int partial_sum = 0;
        for(int i = 0; i < n; ++i) {
            partial_sum += A[i];

            if(i == 0 || partial_sum > max_sum)
                max_sum = partial_sum;

            if(partial_sum < 0)
                partial_sum = 0;
        }
        
        return max_sum;
    }

Java:

Python: