# Leetcode 674 - Longest continuous increasing subsequence

**`Note`

**

`dp[i]`

represents the length of the longest continous increasing subsequence that`ends with nums[i]`

.- dp deduction is pretty simple,
`dp[i] = dp[i-1] + 1`

. - We still need a
`result`

to store the longest length we’ve found so far.

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] |

1 | /** |