human
I found an interesting problem on https://leetcode.com/problems/longest-continuous-increasing-subsequence/:
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).

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. 


Example 2:

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


Note:
Length of the array will not exceed 10,000.

I tried it in Python, but could not do it. Can you solve it?

Can you provide a Python program to find the length of longest continuous increasing subsequence (subarray)?
assistant
#Here is Python program to find the length of longest continuous increasing subsequence (subarray).

class Solution:
     def findLengthOfLCIS(self, nums):
         """
         :type nums: List[int]
         :rtype: int
         """
         
         if nums == []:
             return 0
         longest = 1
         curr = 1
         
         for i in range(0,len(nums)-1):
             if nums[i]<nums[i+1]:
                 curr +=1
                 print(curr)
             else:
                 
                 longest = max(longest,curr)
                 curr = 1
         longest = max(longest,curr)
         return longest