leetcode/Maximum Subarray.js at main · jericashall/leetcode · 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
37
38
39
40
41
//June 4th
/*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*/

var maxSubArray = function(nums) {
    let temp = Number.MIN_SAFE_INTEGER;
    let max = Number.MIN_SAFE_INTEGER;
    for(let i = 0; i < nums.length; i++) {
        temp + nums[i] > nums[i] ? temp = temp + nums[i] : temp = nums[i]
        if (temp > max) {
            max = temp
        }
    }
    return max
};

/*Runtime: 88 ms, faster than 84.32% of JavaScript online submissions for Maximum Subarray.
Memory Usage: 49.9 MB, less than 95.68% of JavaScript online submissions for Maximum Subarray.*/