JavaScript-Leetcode-Problems/maximumSubarray.js at master · Shotagog/JavaScript-Leetcode-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
//////////////////////////////////////////////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 = function(nums) {
    let maxS = nums[0], sum = nums[0];

    for(let i = 1; i < nums.length; i++){
        sum = Math.max(nums[i], sum + nums[i]);
        maxS = Math.max(maxS, sum);
    }
    return maxS;
};

// console.log(maxSubArray([-2,1,-3,4,-1,2,1,-5,4]));
// console.log(maxSubArray([1]));
// console.log(maxSubArray([5,4,-1,7,8]));
// console.log(maxSubArray([-1,0]));
// console.log(maxSubArray([-1]));
// console.log(maxSubArray([-2,1]));
// console.log(maxSubArray([1,-1,1]));
// console.log(maxSubArray([-1,0,-2]));