1800.js

/** ------------------------------------------------------------------------------
 * 
 * 1800. Maximum Ascending Subarray Sum
 * Topics: Array
 * https://leetcode.com/problems/maximum-ascending-subarray-sum/?envType=daily-question&envId=2025-02-04
 * 
 ------------------------------------------------------------------------------ */
/**
 * @param {number[]} nums
 * @return {number}
 */
var maxAscendingSum = function (nums) {
  let answer = nums[0]
  let sum = nums[0]

  for (let i = 1; i < nums.length; i++) {
    if (nums[i - 1] < nums[i]) {
      sum += nums[i]
    } else {
      sum = nums[i]
    }

    answer = Math.max(answer, sum)
  }
  return answer
}

console.log(maxAscendingSum([10, 20, 30, 5, 10, 50]))