Package g1701_1800.s1800_maximum_ascending_subarray_sum

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1800 - Maximum Ascending Subarray Sum.

    Easy

    Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums.

    A subarray is defined as a contiguous sequence of numbers in an array.

    A subarray <code>nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub></code> is ascending if for all i where l &lt;= i &lt; r, <code>nums<sub>i</sub>< nums<sub>i+1</sub></code>. Note that a subarray of size 1 is ascending.

    Example 1:

    Input: nums = 10,20,30,5,10,50

    Output: 65

    Explanation: 5,10,50 is the ascending subarray with the maximum sum of 65.

    Example 2:

    Input: nums = 10,20,30,40,50

    Output: 150

    Explanation: 10,20,30,40,50 is the ascending subarray with the maximum sum of 150.

    Example 3:

    Input: nums = 12,17,15,13,10,11,12

    Output: 33

    Explanation: 10,11,12 is the ascending subarray with the maximum sum of 33.

    Constraints:

    • 1 &lt;= nums.length &lt;= 100

    • 1 &lt;= nums[i] &lt;= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxAscendingSum(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait