674. 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==0)
            return 0;
        int t=1,ans=1;
        for(int i=0;i+1<nums.length;i++)
        {
            if(nums[i+1]>nums[i])
                t++;
            else
                t=1;
            ans=Math.max(ans,t);
        }
        return ans;
    }
}