674.最长连续递增序列

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