Maximum Subarray

最大子数组, 这个是经典算法.

public class Solution {
    public int maxSubArray(int[] nums) {
        int max = Integer.MIN_VALUE;
        int sum = 0;
        for(int i = 0; i < nums.length; i++) {
            sum = sum + nums[i];
            max = Math.max(max, sum);
            sum = sum > 0 ? sum:0;
        }
        return max;
    }
}