Kadane's Algorithm

maxSubArray.ts

function maxSubArray(nums: number[]): number {
    let max = nums[0];
    let curSum = nums[0];
    for (let i = 1; i < nums.length; i++) {
        if (curSum < 0) curSum = nums[i]; 
        else curSum += nums[i];
        if (max < curSum) max = curSum;               
    }
    return max;
};