首页 > 其他 > 详细

Jan 18 - Maximum Subarray; DAC; DP; Array;

时间:2016-01-19 07:57:58      阅读:173      评论:0      收藏:0      [点我收藏+]

Iteration:

public class Solution {
    public int maxSubArray(int[] nums) {
        int start = 0, end = nums.length-1;
        //return sumSubArray(nums, 0, Integer.MIN_VALUE, start, end);
        int max = Integer.MIN_VALUE;
        int sum = 0;
        while(start <= end){
            sum += nums[start];
            if(sum <= 0){
                max = sum > max? sum:max;
                start++;
                sum = 0;
            }
            else{
                max = sum > max? sum:max;
                start++;
            }
        }
        return max;
    }
}

  

Jan 18 - Maximum Subarray; DAC; DP; Array;

原文:http://www.cnblogs.com/5683yue/p/5141006.html

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