Given an unsorted array of integers, find the length of the longest continuous increasing subsequence and return it. eg: [1,3,2,4,6,3,2,4,5,6,7,3,8] => [2,4,5,6,7]
Given an unsorted array of integers, find the length of the longest continuous increasing subsequence and return it. eg: [1,3,2,4,6,3,2,4,5,6,7,3,8] => [2,4,5,6,7]
