583. 两个字符串的删除操作
题目链接:力扣
代码:
class Solution {
public:
int minDistance(string word1, string word2) {
int n1 = word1.size();
int n2 = word2.size();
vector<vector<int>> dp(n1+1,vector<int>(n2+1,0));
for(int i = 1; i <= n1; i++)
{
for(int j = 1; j <= n2; j++)
{
if(word1[i-1] == word2[j-1])
dp[i][j] = dp[i-1][j-1]+1;
else
dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
}
}
int same = dp[n1][n2];
int result = n1-same+n2-same;
return result;
}
};
先找到相同的数量 然后减一下
代码二:
class Solution {
public:
int minDistance(string word1, string word2) {
int n1 = word1.size();
int n2 = word2.size();
vector<vector<int>> dp(n1+1,vector<int>(n2+1,0));
//dp[i][j] [0,i-1]的word1和[0,j-1]的word2要删除的个数
for(int i = 0 ; i <= n1; i++)
dp[i][0] = i;
for(int j = 0; j <= n2; j++)
dp[0][j] = j;
for(int i = 1; i <= n1; i++)
{
for(int j = 1; j <= n2; 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],dp[i][j-1])+1;
}
}
int same = dp[n1][n2];
return same;
}
};
72. 编辑距离
题目链接:力扣
代码:
class Solution {
public:
int minDistance(string word1, string word2) {
int s1 = word1.size();
int s2 = word2.size();
vector<vector<int>> dp(s1+1,vector<int>(s2+1));
//dp[i][j] 表示以下标i-1为结尾的字符串word1,和以下标j-1为结尾的字符串word2,最近编辑距离为dp[i][j]
for(int i = 0; i <= s1; i++)
dp[i][0] = i;
for(int j = 0; j <= s2 ;j++)
dp[0][j] = j;
for(int i = 1 ; i <= s1; i++)
{
for(int j = 1 ; j <= s2; 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],min(dp[i][j-1],dp[i-1][j-1]))+1;
}
}
return dp[s1][s2];
}
};
要分情况讨论:
首先dp[i][j] 表示以下标i-1为结尾的字符串word1,和以下标j-1为结尾的字符串word2,最近编辑距离为dp[i][j]
如果一样 那么就dp[i][j] = dp[i-1][j-1];
如果删除word1 那么就相当于是看以下标为i-2的word1和以下标为j-1的word2比较,在dp[i-1][j]的基础上加1
如果增加word1 其实就相当于删除word2,相当于看以下标为i-1的word1和以下标为j-2的word2比较,在dp[i][j-1]的基础上加1
如果是修改的话 就相当于让word1的i-1和word2的j-1一样,就在dp[i-1][j-1]的基础上加1
编辑距离总结
代码随想录