14.最大子序和

var maxSubArray = function(nums) {
    let max = nums[0];
    let min = 0;
    let sum = 0;
    for(let i=0; i<nums.length; i++) {
        sum += nums[i];
        max = Math.max(max, sum-min);
        min = Math.min(sum, min);
    }
    return max;
}