Longest Increasing Subsequence
ARRAY

Problem

Given an unsorted array of integers nums, find the length of the longest continuous increasing subsequence (subarray).

The subsequence must be strictly increasing.

Examples

lcisLength([1,2,3,1,2,3,4,5]) // returns 5 // The longest continuous increasing subsequence // is [1,2,3,4,5], which has length 5 lcisLength([5,6,1,2,3,4]) // returns 4 // The longest continuous increasing subsequence // is [1,2,3,4], which has length 4
Loading...