input: Write a function to find the length of the longest continuous increasing subsequence in a list.
  assert findLengthOfLCIS([1, 9, 3, 10, 4, 20, 2]) == 2
  assert findLengthOfLCIS([1, 3, 5, 4, 7]) == 3
  assert findLengthOfLCIS([2, 2, 2, 2, 2]) == 1
  assert findLengthOfLCIS([]) == 0
  assert findLengthOfLCIS([1, 2, 3, 4, 5]) == 5
output: def findLengthOfLCIS(nums):
      if not nums:
          return 0
      
      max_length = 1
      current_length = 1
      
      for i in range(1, nums.length):
          if nums[i] > nums[i - 1]:
              current_length += 1
              max_length = max(max_length, current_length)
          else:
              current_length = 1
      
      return max_length