leetCode刷题记录76_674_Longest Continuous Increasing Subsequence

/*****************************************************问题描述*************************************************
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
Example 1:
    Input: [1,3,5,4,7]
    Output: 3
    Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. 
    Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4. 
Example 2:
    Input: [2,2,2,2,2]
    Output: 1
    Explanation: The longest continuous increasing subsequence is [2], its length is 1. 
给定一个整数数组，它的子数组必须是升序，返回这样的子数组的长度.
/*****************************************************我的解答*************************************************
/**
 * @param {number[]} nums
 * @return {number}
 */
var findLengthOfLCIS = function(nums) {
    var retHigh = 0;
    console.log(nums);
    for(var start = 0; start < nums.length; start++)
    {
        var currentHigh = 1;
        console.log(start);
        for(var end = start; end < nums.length; end++)
        {
            console.log('nums[end]:' + nums[end]);
            console.log('nums[end + 1]:' + nums[end + 1]);
            if(nums[end] >= nums[end + 1] || nums[end + 1] === undefined)
            {
                break;
            }    
            else
            {
                currentHigh++;
            }    
        }
        if(currentHigh > retHigh)
        {
            retHigh = currentHigh;
        }
    }    
    return retHigh;
};
console.log('result:' + findLengthOfLCIS([1,3,5,7]));