[LeetCode] Maximum Subarray

zjjee

于 2014-11-17 16:44:06 发布

阅读量225

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/zjjee/article/details/41211877

LeetCode 专栏收录该内容

131 篇文章

订阅专栏

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

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

class Solution {
public:
    int maxSubArray(int A[], int n) {
        int sum = INT_MIN;
        int sum_max = INT_MIN;
        for(int i = 0;i < n;i ++){
            sum = sum < 0 ? A[i] : A[i] + sum;
            if(sum_max < sum)
                sum_max = sum;
        }
        return sum_max;
    }
};