Find the Longest Continuous Increasing Subsequence

Problem Statement

Given an array of integers nums, find the length of the longest continuous strictly increasing subarray.

A continuous increasing subarray is defined as a sequence of adjacent elements [nums[i], nums[i + 1], ..., nums[j]] such that for all k where i <= k < j, nums[k] < nums[k + 1].

Note that equal adjacent values (e.g., nums[k] == nums[k + 1]) do not qualify as strictly increasing and must terminate the current run.

Function Signature

def find_length_of_lcis(nums: list[int]) -> int:
    pass

Examples

Example 1

Input: nums = [1, 3, 5, 4, 7]
Output: 3
Explanation: The longest continuous increasing subarray is [1, 3, 5] with length 3. 
Even though [1, 3, 5, 7] is increasing, it is not continuous (index 3 is skipped).

Example 2

Input: nums = [2, 2, 2, 2, 2]
Output: 1
Explanation: The longest continuous increasing subarray is [2] with length 1 because equal adjacent elements break the strictly increasing condition.

Example 3

Input: nums = []
Output: 0
Explanation: An empty array has no elements, so the maximum length is 0.

Constraints

• 0 <= len(nums) <= 10^5
• -10^9 <= nums[i] <= 10^9
• Time complexity should be O(n) with O(1) auxiliary space.