Problem Description
Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be strictly increasing.
Key Insights
- A continuous increasing subsequence requires that each element in the subsequence is less than the next.
- We need to find the maximum length of such subsequences within the array.
- A single element is considered a valid increasing subsequence.
Space and Time Complexity
Time Complexity: O(n)
Space Complexity: O(1)
Solution
To solve this problem, we can use a simple linear scan through the array while keeping track of the current length of the increasing subsequence. We compare each element with the previous one to determine if it is part of an increasing sequence. If it is, we increment the current length; if not, we reset the current length. We also maintain a variable to store the maximum length found during the scan.