首页 > itarticle > maximum subarray

maximum subarray

admin 11月 13, 2020 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.

Solution

public class  {
    public int maxSubArray(int[] nums) {
        int b=0,max=nums[0];
        for(int i=0; i<nums.length; i++) {
            if(b>=0) b+=nums[i];
            else b = nums[i];
            if(b>max){
                max = b;
            } 
        }
        return max;
    }
}