力扣674. 最长连续递增序列

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