[LeetCode] Maximum Ascending Subarray Sum - JavaScript

👩🏻‍💻 문제

LeetCode #1800 Maximum Ascending Subarray Sum

👩🏻‍💻 풀이

var maxAscendingSum = function(nums) {
    let answer = nums[0];
    let sum = nums[0];
    
    for(let i = 1; i < nums.length; i++) {
        let cur = nums[i];
        if(cur <= nums[i-1]) {
            sum = 0;
        }
        sum += cur;
        answer = Math.max(answer, sum);
    }
    
    return answer;
};