Maximum Ascending Subarray Sum
给一个数组, 求其中的最大和的递增子数组的和是多少.
class Solution {
public int maxAscendingSum(int[] nums) {
int prev = Integer.MIN_VALUE;
int res = 0;
int tmp = 0;
for(int i = 0; i < nums.length; i++){
if(prev < nums[i]){
tmp += nums[i];
}else{
tmp = nums[i];
}
prev = nums[i];
res = Math.max(res, tmp);
}
return res;
}
}