> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0674-longest-continuous-increasing-subsequence.md).

# 0674. Longest Continuous Increasing Subsequence

<https://leetcode.com/problems/longest-continuous-increasing-subsequence>

## 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.

A **continuous increasing subsequence** is defined by two indices `l` and `r` (`l < r`) such that it is `[nums[l], nums[l + 1], ..., nums[r - 1], nums[r]]` and for each `l <= i < r`, `nums[i] < nums[i + 1]`.

**Example 1:**

```
**Input:** nums = [1,3,5,4,7]
**Output:** 3
**Explanation:** The longest continuous increasing subsequence is [1,3,5] with length 3.
Even though [1,3,5,7] is an increasing subsequence, it is not continuous as elements 5 and 7 are separated by element
4.
```

**Example 2:**

```
**Input:** nums = [2,2,2,2,2]
**Output:** 1
**Explanation:** The longest continuous increasing subsequence is [2] with length 1. Note that it must be strictly
increasing.
```

**Constraints:**

* `1 <= nums.length <= 104`
* `-109 <= nums[i] <= 109`

## ac

```java
class Solution {
    public int findLengthOfLCIS(int[] nums) {
        // edge cases

        int len = 0;
        for (int r = 0, l = 0; r < nums.length; r++) {
            if (r == nums.length - 1 || nums[r] >= nums[r+1]) {
                len = Math.max(len, r - l + 1);
                l = r+1;
            }
        }

        return len;
    }
}

/*
just 2 pointers iterate through
*/
```