Maximum Absolute Sum of Any Subarray LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @return {number}
4
 */
5
var maxAbsoluteSum = function (nums) {
6
  (maxi = Number.MIN_VALUE), (mini = Number.MAX_VALUE);
7
  (cur_max = 0), (cur_min = 0);
8
  for (let i = 0; i < nums.length; i++) {
9
    cur_max = Math.max(cur_max + nums[i], nums[i]);
10
    cur_min = Math.min(cur_min + nums[i], nums[i]);
11
    maxi = Math.max(maxi, cur_max);
12
    mini = Math.min(mini, cur_min);
13
  }
14
  return Math.max(maxi, -mini);
15
};