首页 > 其他 > 详细

leetcode Maximum Subarray

时间:2014-11-02 07:05:07      阅读:261      评论: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.

1,注意解题方法,设置两个变量,current,用来纪录当前值,和Max比较,如果为负,就把它设置为0.

package Leetcode;
public class MaximumSubarray {
    public int maxSubArray(int[] A) {
        int max=0;
        int current=0;
        for(int i=0;i<A.length;i++){
            current+=A[i];
            if(current>max){
                max=current;
            }
            if(current<0){
                current=0;
            }
        }
        return max;
    }
}

 

leetcode Maximum Subarray

原文:http://www.cnblogs.com/lilyfindjobs/p/4068332.html

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