Maximum Ascending Subarray Sum
Easy
Topics
Given an array nums, return the maximum possible sum of a strictly ascending contiguous subarray.
Example 1
Input: nums = [10,20,30,5,10,50] Output: 65
Example 2
Input: nums = [10,20,30,40,50] Output: 150
Example 3
Input: nums = [12,17,15,13,10,11,12] Output: 33
Constraints
- 1 <= nums.length <= 100
- 1 <= nums[i] <= 100
Run ⌘' · Submit ⌘⏎
SensAI