Longest Continuous Increasing Subsequence LeetCode solution in Python

1
# Runtime: 416 ms (Top 5.00%) | Memory: 15.4 MB (Top 49.36%)
2

3

4
class Solution:
5
    def findLengthOfLCIS(self, nums: List[int]) -> int:
6
        count = 0
7
        for i in range(len(nums)):
8
            a = nums[i]
9
            c = 1
10
            for j in range(i + 1, len(nums)):
11
                if nums[j] > a:
12
                    a = nums[j]
13
                    c += 1
14
                else:
15
                    break
16
            count = max(count, c)
17
        return count