Maximum Ascending Subarray Sum LeetCode solution in JavaScript

1
var maxAscendingSum = function (nums) {
2
  const subarray = nums.reduce((acc, curr, index) => {
3
    curr > nums[index - 1] ? (acc[acc.length - 1] += curr) : acc.push(curr);
4
    return acc;
5
  }, []);
6

7
  return Math.max(...subarray);
8
};