不同的子序列
力扣题目链接
class Solution {
int MOD = 1e9+7;
public:
int numDistinct(string s, string t) {
int len1 = s.length();
int len2 = t.length();
vector<vector<int>> dp(len2+1, vector<int>(len1+1, 0));
for(int i = 0; i <= len1; i++){
dp[0][i] = 1;
}
for(int i = 1; i <= len2; i++){
for(int j = i; j <= len1; j++){
dp[i][j] = dp[i][j-1];
if(t[i-1] == s[j-1]){
dp[i][j] += dp[i-1][j-1];
}
dp[i][j] %= MOD;
}
}
return dp[len2][len1];
}
};
两个字符串的删除操作
力扣题目链接
class Solution {
public:
int minDistance(string word1, string word2) {
int len1 = word1.size();
int len2 = word2.size();
vector<vector<int>> dp(len1+1, vector<int>(len2+1, 0));
for(int i = 1; i <= len1; i++){
dp[i][0] = i;
}
for(int j = 1; j <= len2; j++){
dp[0][j] = j;
}
for(int i = 1; i <= len1; i++){
for(int j = 1; j<= len2; j++){
if(word1[i-1] == word2[j-1]){
dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])+1);
}
else{
dp[i][j] = min(dp[i-1][j], dp[i][j-1])+1;
}
}
}
return dp[len1][len2];
}
};
编辑距离
力扣题目链接
class Solution {
public:
int minDistance(string word1, string word2) {
int len1 = word1.size();
int len2 = word2.size();
vector<vector<int>> dp(len1+1, vector<int>(len2+1, 0));
for(int i = 1; i <= len1; i++){
dp[i][0] = i;
}
for(int j = 1; j <= len2; j++){
dp[0][j] = j;
}
for(int i = 1; i <= len1; i++){
for(int j = 1; j<= len2; j++){
if(word1[i-1] == word2[j-1]){
dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1])+1);
}
else{
dp[i][j] = min(dp[i-1][j-1], min(dp[i-1][j], dp[i][j-1]))+1;
}
}
}
return dp[len1][len2];
}
};