首页 > 其他 > 详细

maximum-subarray 序列最大连续和 贪心

时间:2018-09-13 23:52:23      阅读:282      评论:0      收藏: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.

贪心算法,当连续和sum>0时,sum+=A[i],负责sum=A[i]
class Solution {
public:
    int maxSubArray(int A[], int n) {
        int max=A[0],sum=0;
        for(int i=0;i<n;++i)
        {
            if(sum<0)
                sum=A[i];
            else
                sum+=A[i];
            max=max<sum?sum:max;
        }
        return max;
    }
};

 

maximum-subarray 序列最大连续和 贪心

原文:https://www.cnblogs.com/zl1991/p/9643901.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!