674. Longest Continuous Increasing Subsequence

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

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