[Leetcode]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.

思路：如果数组的长度小于2，则直接返回数组的长度；否则设置两个变量maxLength=1和length=1，length用于统计

连续递增的子序列长度，一旦递增中断，则lenth重置为1，继续后面的统计。这个过程中，最大的length值赋给maxLength

 class Solution {
     public int findLengthOfLCIS(int[] nums) {
         if (nums.length<2)
             return nums.length;
         int maxLength = 1,length = 1;
         for (int i=1;i<nums.length;i++){
             if (nums[i]>nums[i-1])
                 length++;
             else
                 length = 1;
             if (length>maxLength)
                 maxLength = length;
         }
         return maxLength;
     }
 }