题目链接:https://leetcode.cn/problems/maximum-ascending-subarray-sum/
时间复杂度为
O
(
n
)
O(n)
O(n)
空间复杂度为
O
(
1
)
O(1)
O(1)
class Solution {
public:
int maxAscendingSum(vector<int>& nums) {
int n = nums.size();
int curSum = nums[0];
int maxSum = nums[0];
for (int i = 1; i < n; i++) {
if (nums[i] > nums[i - 1]) {
curSum += nums[i];
} else {
curSum = nums[i];
}
maxSum = max(maxSum, curSum);
}
return maxSum;
}
};