码迷,mamicode.com
首页 > 其他好文 > 详细

Maximum Subarray

时间:2014-11-08 16:45:18      阅读:111      评论:0      收藏:0      [点我收藏+]

标签:style   blog   http   io   color   ar   sp   for   div   

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.

 

Hide Tags
 Divide and Conquer Array Dynamic Programming
 
class Solution {
public:
    int maxSubArray(int A[], int n) {
        int sum=0;
        int subsum=INT_MIN;
        for(int i=0;i<n;i++){
            sum=max(sum+A[i],A[i]);
            subsum=max(sum,subsum);
        }
        return subsum;
    }
};

 

Maximum Subarray

标签:style   blog   http   io   color   ar   sp   for   div   

原文地址:http://www.cnblogs.com/li303491/p/4083563.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!