maximum-subarray

最新推荐文章于 2024-11-17 06:32:34 发布

llwjason5555

最新推荐文章于 2024-11-17 06:32:34 发布

阅读量160

点赞数

分类专栏： leetcode 文章标签： leetcode 贪心算法

本文链接：https://blog.csdn.net/llwjason5555/article/details/77979241

版权

leetcode 专栏收录该内容

116 篇文章 0 订阅

订阅专栏

题目：

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 reach=A[0];
        int max=A[0];
        for(int i=1;i<n;i++)
        {
            reach=reach+A[i];
            A[i]=A[i]>reach?A[i]:reach;
            reach=A[i];
        }
        
        for(int i=1;i<n;i++)
        {
            if(A[i]>max)
                max=A[i];
        }
        
        return max;
    }
};

点评：

贪心算法，选取目前最优，与 jump-game类似