leetcode刷题（64）——674. 最长连续递增序列

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