LeetCode: Maximum Ascending Subarray Sum Solution

1/**
2 * @param {number[]} nums
3 * @return {number}
4 */
5var maxAscendingSum = function (nums) {
6  const N = nums.length
7  let sum = nums[0]
8  let max = sum
9  for (let i = 1; i < N; i++) {
10    if (nums[i] <= nums[i - 1]) {
11      sum = 0
12    }
13    sum += nums[i]
14    max = Math.max(max, sum)
15  }
16  return max
17}