机试刷题_674. 最长连续递增序列【python】

674. 最长连续递增序列

class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
        if not nums:
            return 0
        if len(nums)==1:
            return 1
        left = 0
        right = len(nums)-1
        tmp = []
        tmp.append(nums[0])
        res = 0
        while left<right:
            if nums[left]<nums[left+1]:
                tmp.append(nums[left+1]) 
                left += 1
            else:
                tmp = []
                tmp.append(nums[left]) 
                left += 1
            res = max(res,len(tmp))

        return res

官方题解：

class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
        ans = 0
        n = len(nums)
        start = 0

        for i in range(n):
            if i > 0 and nums[i] <= nums[i - 1]:
                start = i
            ans = max(ans, i - start + 1)
        
        return ans