Leetcode 674 最长连续子序列

    public final int findLengthOfLCIS(int[] nums) {
        if (nums.length < 2) return nums.length;
        int len = nums.length, left = 0, right = 1, re = 0;
        while (left < len && right < len) {
            int currRe = 1;
            while (nums[right] > nums[left]) {
                currRe++;
                left++;
                right++;
                if (right == len) return Math.max(currRe, re);
            }
            if (currRe > re) re = currRe;
            left = right;
            right++;
        }
        return re;
    }

/**
 * @param {number[]} nums
 * @return {number}
 */
var findLengthOfLCIS = function (nums) {
    let len = nums.length;
    if (len < 2) return len;
    let left = 0, right = 1, re = 0;
    while (right < len) {
        let currRe = 1;
        while (right < len && nums[right] > nums[left]) {
            left++;
            right++;
            currRe++;
        }
        re = re > currRe ? re : currRe;
        left=right;
        right++;
    }
    return re;
};