Maximum Ascending Subarray Sum LeetCode solution in Java

1
class Solution {
2
  public int maxAscendingSum(int[] nums) {
3
    int res = nums[0], temp = nums[0];
4
    for (int i = 1; i < nums.length; i++) {
5
      if (nums[i] > nums[i - 1]) temp += nums[i];
6
      else temp = nums[i];
7
      res = Math.max(res, temp);
8
    }
9
    return res;
10
  }
11
}