LeetCode题解(1800)：最大升序子数组和(Python)

题目：​​原题链接​​（简单）

标签：双指针

解法一：

class Solution:
    def maxAscendingSum(self, nums: List[int]) -> int:
        ans = 0
        now = 0
        last = 0
        for num in nums:
            if num > last:
                now += num
            else:
                now = num
            last = num
            ans = max(ans, now)
        return