leetcode 1800. Maximum Ascending Subarray Sum

class Solution:
    def maxAscendingSum(self, nums: List[int]) -> int:
        ans=[]
        tmp=0
        if len(nums)== 1: ans.append(nums[0])
        else :
            for i in range(len(nums)-1):
                if nums[i]<nums[i+1]:tmp+=nums[i]
                else :
                    tmp += nums[i]
                    ans.append(tmp)
                    tmp=0
                if i==len(nums)-2 : ans.append(tmp+nums[-1])
        return max(ans)