LeetCode：

最新推荐文章于 2020-11-04 11:05:17 发布

Chan_Keh

最新推荐文章于 2020-11-04 11:05:17 发布

阅读量242

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/lwgechen/article/details/55681761

LeetCode 专栏收录该内容

101 篇文章

订阅专栏

本文介绍了一种寻找具有最大和的连续子数组的算法。通过动态规划方法，该算法能在O(n)的时间复杂度内解决问题。例如，在数组[-2,1,-3,4,-1,2,1,-5,4]中，子数组[4,-1,2,1]的和最大为6。

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

链接：https://www.nowcoder.com/practice/32139c198be041feb3bb2ea8bc4dbb01?tpId=46&tqId=29126&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-ranking
来源：牛客网

题目描述

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.

class Solution {
public:
    int maxSubArray(int A[], int n) {
       // int v = 0;
        vector<int>v;

        for(int i=0;i<n;++i)
         {
           v.push_back(0);   
         }
        v[0] = A[0];

        int result = A[0];
        for(int i=1;i<n;++i)
         {
             v[i] = max(v[i-1]+A[i],A[i]);
             result = max(result,v[i]);
         }
        return result;
    }
};