最长连续递增子序列

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

Example 1

Input: [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3.
Even though [1,3,5,7] is also an increasing subsequence, it’s not a continuous one where 5 and 7 are separated by 4.

Example2

Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.

def findLengthOfLCIS(nums):
    n=len(nums)
    Max = i = 0
    while i < n:
        cur = 1
        while i < n-1 and nums[i+1]>nums[i]:
            cur+=1
            i+=1
        Max = max(Max,cur)
        i+=1
    return Max