LeetCode之旅（19）

最新推荐文章于 2022-10-07 11:16:54 发布

木薏米

最新推荐文章于 2022-10-07 11:16:54 发布

阅读量304

点赞数

分类专栏：算法学习文章标签： LeetCode

本文链接：https://blog.csdn.net/xy14qg/article/details/38901769

版权

算法学习专栏收录该内容

40 篇文章 0 订阅

订阅专栏

Maximum Subarray

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=A[0], tmp=0;
        for (int i=0; i<n; i++) {
            tmp += A[i];
            if (tmp > sum) sum = tmp;
            if (tmp < 0) tmp = 0;
        }
        return sum;
    }
};