Maximum Subarray LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @return {number}
4
 */
5
var maxSubArray = function (nums) {
6
  let max = Number.MIN_SAFE_INTEGER;
7
  let curr = 0;
8
  for (let i = 0; i < nums.length; i++) {
9
    if (curr < 0 && nums[i] > curr) {
10
      curr = 0;
11
    }
12
    curr += nums[i];
13
    max = Math.max(max, curr);
14
  }
15
  return max;
16
};