Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1800 with 25 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1800 # by problem number
lcpy gen -s maximum_ascending_subarray_sum # by problem name
nums, return the maximum possible sum of an strictly increasing subarray in nums.
A subarray is defined as a contiguous sequence of numbers in an array.
Input: nums = [10,20,30,5,10,50]
Output: 65
Explanation: [5,10,50] is the ascending subarray with the maximum sum of 65.
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.
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.
class Solution:
# Time: O(n)
# Space: O(1)
def max_ascending_sum(self, nums: list[int]) -> int:
best = cur = nums[0]
for i in range(1, len(nums)):
if nums[i] > nums[i - 1]:
cur += nums[i]
else:
cur = nums[i]
if cur > best:
best = cur
return best
| Time | Space |
|---|---|
| O(n) | O(1) |