The longest continuous increasing subsequence is [2] with length 1. Note that it must be strictly increasing.

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9

Solution

Method 1 – Single Pass Linear Scan (1)

Intuition

We can find the longest continuous increasing subsequence by scanning the array once, keeping track of the current increasing segment and updating the maximum length found so far.

Approach

Initialize two variables: ans for the maximum length and cur for the current segment length.
Iterate through the array:
- If the current number is greater than the previous, increment cur.
- Otherwise, reset cur to 1.
- Update ans if

Related Tags