Longest Continuous Increasing Subsequence

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

Example 1:

Input: [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. 
Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4. 

Example 2:

Input: [2,2,2,2,2]

Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.
Note: Length of the array will not exceed 10,000.

答案

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        if(nums.length <= 1) return nums.length;
        int left = 0, right = 1, maxlen = 0;
        while(right < nums.length) {
            if(nums[right] > nums[right - 1]) {
                right++;
                if(right >= nums.length)
                    maxlen = Math.max(maxlen, (right - 1) - left + 1);
            }
            else {
                maxlen = Math.max(maxlen, (right - 1) - left + 1);
                left = right;
                right = right + 1;
            }
        }
        return maxlen;
    }
}