674 Longest Continuous Increasing Subsequence（每日一题）

674：Longest Continuous Increasing Subsequence

• 每日一题的第一天
• 解题思路
  • 双重循环

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        if( nums.length < 2 ) return nums.length;
        int result=1;
        int i=1,j=1;
        for(;i<nums.length;){
            int temp=1;
            for(j=i;j<nums.length;j++){
                if(nums[j]- nums[j-1] >0){
                    temp++;
                }
                else{
                    break;
                }
            }
            if(temp>result) result=temp;
            i=j+1;
        }

        return result;
    }
}