g0001_0100.s0053_maximum_subarray.solution.ts Maven / Gradle / Ivy

Go to download

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
// #2023_09_30_Time_66_ms_(90.36%)_Space_51.9_MB_(80.92%)

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

export { maxSubArray }