Maximum Ascending Subarray Sum LeetCode solution in Python

1
class Solution:
2
    def maxAscendingSum(self, nums: List[int]) -> int:
3
        count = nums[0]
4
        final = nums[0]
5
        for i in range(1, len(nums)):
6
            if nums[i] > nums[i - 1]:
7
                count += nums[i]
8
            else:
9
                count = nums[i]
10
            final = max(final, count)
11
        return final