Approach

Initialize ans to store the maximum sum found so far, and current_sum to maintain the sum of the current ascending subarray.
Iterate through the array. For each element:
- If it is the start of the array or maintains the ascending property with respect to the previous element, add it to current_sum.
- Otherwise, update ans if current_sum is greater than ans, and reset current_sum to the current element.
After the loop, make sure to update ans with current_sum one last time in case the longest ascending subarray is at the end of the array.
Return ans, which holds the maximum sum of an ascending subarray.

Code

[{"language":"Python","code":"class Solution:\n    def maxAscendingSum(self, nums: List[int]) -> int:\n        ans = nums[0]\n        curr_sum = nums[0]\n        \n        for i in range(1, len(nums)):\n            if nums[i - 1] < nums[i]:\n                curr_sum += nums[i]\n            else:\n                curr_sum = nums[i]\n            ans = max(ans, curr_sum)\n        \n        return ans","lang":"python","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> So

Related Tags