Maximum Subarray

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 Solution {
    public int maxSubArray(int[] nums) {
        int pre = -1;
        int max = Integer.MIN_VALUE;
        for(int i=0; i<nums.length; i++){
            if(pre>0){
                pre += nums[i];
            } else {
                pre = nums[i];
            }
            max = Math.max(max, pre);
        }
        return max;
    }
}