(Leet Code JS)Maximum Subarry

53. Maximum Subarray

 

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

A subarray is a contiguous part of an array.

 

Example 1:

Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6.

Example 2:

Input: nums = [1] Output: 1

Example 3:

Input: nums = [5,4,-1,7,8] Output: 23

 

Constraints:

• 1 <= nums.length <= 105
• -104 <= nums[i] <= 104

const maxSubArray = (nums) => {
    const dp = Array.from({length: nums.length}, () => 0);
    let answer = -1000000;
    
    dp[0] = nums[0];
    
    for(let i = 0; i < nums.length; i++){
        dp[i] = nums[i] < dp[i - 1] + nums[i] ? dp[i - 1] + nums[i] : nums[i];
        answer = answer < dp[i] ? dp[i] : answer;
    }
    
    return answer;
};