g1701_1800.s1800_maximum_ascending_subarray_sum.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g1701_1800.s1800_maximum_ascending_subarray_sum;
// #Easy #Array #2022_04_19_Time_0_ms_(100.00%)_Space_42.1_MB_(22.29%)
public class Solution {
public int maxAscendingSum(int[] nums) {
int maxSum = nums[0];
int i = 0;
int j = i + 1;
while (i < nums.length - 1 && j < nums.length) {
int sum = nums[j - 1];
while (j < nums.length && nums[j] - nums[j - 1] > 0) {
sum += nums[j];
j++;
}
i = j;
maxSum = Math.max(maxSum, sum);
j++;
}
return maxSum;
}
}