674. Longest Continuous Increasing Subsequence

问题原文地址点击打开链接

这道题难度easy,时间复杂度O（N）。代码如下

    public int findLengthOfLCIS(int[] nums) {
        if (nums.length == 0 || nums == null) return 0 ;
        if (nums.length == 1) return 1;
        int maxlength = 0;
        int temlength = 1;//记录以上一个元素为结尾的递增序列的长度
        for (int i = 1;i<nums.length;i++){
            if (nums[i]>nums[i-1]){
                temlength++;
                if (i == nums.length-1){
                    if (temlength > maxlength)
                        maxlength = temlength;
                }
            }else{
                if (temlength > maxlength)
                    maxlength = temlength;
                temlength = 1;
            }
        }
        return maxlength;
    }