53. Maximum Subarray java solutions

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.

 

Subscribe to see which companies asked this question

 

public class Solution {
    public int maxSubArray(int[] nums) {
        if(nums == null) return 0;
        if(nums.length == 1) return nums[0];
        int curmax = 0;
        int ans = Integer.MIN_VALUE;
        for(int i = 0;i<nums.length;i++){
            curmax += nums[i];
            ans = Math.max(curmax,ans);
            if(curmax < 0) curmax = 0;
        }
        return ans;
    }
}

使用DP即可。

如果要求的是subarray的 的起始位置，则需要加上 startIndex， 和endIndex变量。即可得出。