leetcode:easy:maximum-subarray.ts

function maxSubArray(nums: number[]): number {
let current_max =  nums[0]
    let global_max = nums[0]
    if(nums.length == 1) {
        return current_max;
    }
    for (let i= 1 ; i<nums.length ; i++) {
        current_max = current_max + nums[i] >= nums[i] ? current_max + nums[i] : nums[i]
        global_max = current_max > global_max ? current_max : global_max
        
    }
    return global_max
};