[674] 最长连续递增序列
代码
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int n=nums.size();
if(n<=1) return n;
vector<int> dp(n,1);
int i;
int result=0;
for(i=1;i<n;i++)
{
if(nums[i]>nums[i-1])
{
dp[i]=dp[i-1]+1;
}
result=max(dp[i],result);
}
return result;
}
};
[718] 最长重复子数组
class Solution {
public:
int findLength(vector<int>& nums1, vector<int>& nums2) {
int n1=nums1.size();
int n2=nums2.size();
int result=0;
vector<vector<int>> dp(n1+1,vector<int>(n2+1,0));
int i,j;
for(i=1;i<=n1;i++)
{
for(j=1;j<=n2;j++)
{
if(nums1[i-1]==nums2[j-1])
{
dp[i][j]=dp[i-1][j-1]+1;
}
result=max(result,dp[i][j]);
}
}
return result;
}
};
[1143] 最长公共子序列
class Solution {
public:
int longestCommonSubsequence(string text1, string text2) {
int n1=text1.size();
int n2=text2.size();
int i,j;
vector<vector<int>> dp(n1+1,vector<int>(n2+1,0));
for(i=1;i<=n1;i++)
{
for(j=1;j<=n2;j++)
{
dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
if(text1[i-1]==text2[j-1])
{
dp[i][j]=dp[i-1][j-1]+1;
}
}
}
return dp[n1][n2];
}
};