1800. 最大升序子数组和

题目：1800. 最大升序子数组和

class Solution {
public:
    int maxAscendingSum(vector<int>& nums) {
        int n = nums.size();
        int index = 0;
        int res = 0;
        int sumTemp = 0;
        while(index<n){
            sumTemp = nums[index];
            index++;
            while(index < n && nums[index]>nums[index-1]){
                sumTemp += nums[index];
                index++;
            }
            res = max(res,sumTemp);
        }
        return res;
    }
};