674. Longest Continuous Increasing Subsequence

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

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.

获取给定数组的最长递增子串长度

解法一：

    public int findLengthOfLCIS(int[] nums) {
        int max=0,left=0;
        if (nums.length==0) return 0;
        while (left<nums.length)
        {
            int count=1;
            int right = left+1;
            while (right<nums.length && nums[left] < nums[right])
            {
                count++;
                left=right;
                right++;
            }
            left=right;
            max = Math.max(max,count);
        }
        return max;
    }