583. 两个字符串的删除操作
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1));
for (int i = 0; i <= word1.size(); i++) dp[i][0] = i;
for (int j = 0; j <= word2.size(); j++) dp[0][j] = j;
for (int i = 1; i <= word1.size(); i++) {
for (int j = 1; j <= word2.size(); j++) {
if (word1[i - 1] == word2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1];
} else {
dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
}
}
}
return dp[word1.size()][word2.size()];
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/461d1e54eced4079a6aae7ae309e8cfc.png)
class Solution {
public:
int minDistance(string word1, string word2) {
vector<int>dp(word1.size()+1, 0);
for(int i=1; i<=word1.size(); i++) dp[i] = i;
int pre = 0, cur = 0;
for(int i=0; i<word2.size(); i++)
{
for(int j=0; j<=word1.size(); j++)
{
cur = dp[j];
if(j==0) {
dp[j] = i+1;
}
else{
if(word2[i]==word1[j-1]) dp[j] = pre;
else dp[j] = min(dp[j-1]+1, dp[j]+1);
}
pre = cur;
}
}
return dp[word1.size()];
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/0bfb7b2a9558456aab1f6b2e33c870d4.png)
72. 编辑距离
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>> dp(word1.size() + 1, vector<int>(word2.size() + 1, 0));
for (int i = 0; i <= word1.size(); i++) dp[i][0] = i;
for (int j = 0; j <= word2.size(); j++) dp[0][j] = j;
for (int i = 1; i <= word1.size(); i++) {
for (int j = 1; j <= word2.size(); j++) {
if (word1[i - 1] == word2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1];
}
else {
dp[i][j] = min({dp[i - 1][j - 1], dp[i - 1][j], dp[i][j - 1]}) + 1;
}
}
}
return dp[word1.size()][word2.size()];
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/7cb8ec1cd76641e395079a8ec2545f6d.png)
class Solution {
public:
int minDistance(string word1, string word2) {
vector<int> dp(word1.size()+1, 0);
for(int i=1; i<word1.size()+1; i++) dp[i] = i;
int pre =0, cur =0;
for(int i=0; i<word2.size(); i++){
for(int j=0; j<=word1.size(); j++){
cur = dp[j];
if(j==0) dp[j] = i+1;
else{
if(word1[j-1] == word2[i]) dp[j] = pre;
else dp[j] = min(dp[j-1]+1, min(dp[j]+1, pre+1));
}
pre = cur;
}
}
return dp[word1.size()];
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/043bacaff03c4087b954974371495a53.png)