674. Longest Continuous Increasing Subsequence

class Solution:
    def findLengthOfLCIS(self, A: List[int]) -> int:
        """
        main idea: use pre to keep track last number as continuous strcictly increasing  subsequence(actually subarray)
        tc O(N) sc O(1)
        [1,0,0,8,6]   => 2
        [1,3,5,4,2,3,4,5] => 4
        """
        max_cnt = cnt = 1
        pre = A[0]
        n = len(A)
        for i in range(1, n) : 
            if pre < A[i]:
                cnt += 1
                pre = A[i]
            else:
                cnt = 1 # otherwise reset count and save current A[i] as previous 
                pre = A[i]
            max_cnt = max(max_cnt,cnt)
        return max_cnt