300.最长递增子序列 ● 674. 最长连续递增序列 ● 718. 最长重复子数组

● 300.最长递增子序列 

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) 
    {
        int len=nums.size();
        if(len<=1)
        return len;
        vector<int>dp(len,1);
        int res=0;
        for(int i=1;i<len;i++)
        {
            for(int j=0;j<i;j++)
            {
                if(nums[j]<nums[i])
                dp[i]=max(dp[i],dp[j]+1);
            }
            if(dp[i]>res)
            res=dp[i];
        }
return res;
    }
};

•  674. 最长连续递增序列 

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) 
    {
        int len=nums.size();
        if(len<=1)
        return len;
        vector<int>dp(len,1);
        int res=0;
        for(int i=1;i<len;i++)
        {
            if(nums[i]>nums[i-1])
            dp[i]=dp[i-1]+1;
            if(res<dp[i])
            res=dp[i];
        }
return res;
    }
};

• 718. 最长重复子数组  

class Solution {
public:
    int findLength(vector<int>& nums1, vector<int>& nums2) 
    {
        int len1=nums1.size();
        int len2=nums2.size();
        int res=0;
        vector<vector<int>>dp(len1+1,vector<int>(len2+1,0));
        for(int i=1;i<=len1;i++)
        {
            for(int j=1;j<=len2;j++)
            {
                if(nums1[i-1]==nums2[j-1])
                dp[i][j]=dp[i-1][j-1]+1;
                if(res<dp[i][j])
                res=dp[i][j];
            }
            
            
        }
        return res;
    }
};