33: Longest continuous increasing subsequence

Given an array of integers, find the length of the longest continuous increasing subsequence

 

Example 1

Input: [3, 2, 9, 10, 11, 7]

Output: 3

Explanation: [9, 10, 11]

Example 2

Input: [3, 2, 1]

Output: 1
Difficulty:Easy
Topic:Array
Problem #:33