示例代码
class Solution {
public:
bool isSubsequence(string text1, string text2) {
int len1=text1.length(),len2=text2.length();
vector<vector<int>> dp(len1+1,vector<int>(len2+1));
for(int i=1;i<=len1;i++){
for(int j=1;j<=len2;j++){
if(text1[i-1]==text2[j-1]){
dp[i][j]=dp[i-1][j-1]+1;
}else{
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
}
}
}
return dp[len1][len2]==len1;
}
};
效果展示
方法二(快慢指针)
示例代码
class Solution {
public:
bool isSubsequence(string text1, string text2) {
int len1=text1.length(),len2=text2.length();
int i=0,j=0;
while(i<len1&&j<len2){
if(text1[i]==text2[j]){
i++;
j++;
}else{
j++;
}
}
return i==len1;
}
};
效果展示