一、题目内容

二、题解

解法1：

思路

dp[i] = nums[i] > nums[i-1] ? dp[i-1] + 1 : 1

代码

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        //dp[i] = nums[i] > nums[i-1] ? dp[i-1] + 1 : 1;
        if (nums == null || nums.length == 0) {
            return 0;
        }
        if(nums.length == 1){
            return 1;
        }
        int[] dp = new int[nums.length];
        dp[0] = 1;
        int maxLen = dp[0];
        for(int i = 1;i<nums.length;i++){
            if(nums[i]>nums[i-1]){
                dp[i] = dp[i-1]+1;
            }else{
                dp[i] = 1;
            }
            maxLen = Math.max(maxLen,dp[i]);
        }
        return maxLen;
    }
}