LeetCode674. 最长连续递增序列

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.

• dp[i]:以下标为i结尾的最长递增子序列的长度，
• 递归函数：dp[i]=dp[i-1]+1(dp[i-1]<dp[i])
• 初始值：dp[0]=1
• for循环：只用一个i循环

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

    }
}