1800. 最大升序子数组和
思路:直接模拟
func maxAscendingSum(nums []int) int {
ans, cur_num := 0, 0
for i, v := range nums {
if i == 0 || v > nums[i-1] {
cur_num += v
ans = max(ans, cur_num)
} else {
cur_num = v
}
}
return ans
}
func max(a, b int) int {
if a > b {
return a
}
return b
}