583. 两个字符串的删除操作
题目链接:583. 两个字符串的删除操作
文档讲解:代码随想录
思路
dp数组:dp[i][j]表示以i - 1结尾的字符串word1,和以j - 1结尾的字符串word2,想要达到相等,所需要删除元素的最少次数。
递推公式:
- 如果word1[i - 1] == word2[j - 1],那么dp[i][j] = dp[i][j]
- 如果word1[i - 1] != word2[j - 1],那么:
– 删除word1[i - 1],次数为dp[i - 1][j] + 1
– 删除word2[j - 1],次数为dp[i][j - 1] + 1
– 删除word1[i - 1]和word2[j - 1],次数为dp[i - 1][j - 1] + 2
– 以上三者取最小值
代码
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 = 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] + 1;
else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
return word1.size() + word2.size() - dp[word1.size()][word2.size()] * 2;
}
};
72. 编辑距离
题目链接:72. 编辑距离
文档讲解:代码随想录
思路
dp数组:dp[i][j]表示以下标i - 1结尾的字符串word1,和以下标j - 1结尾的字符串word2,最近编辑距离为dp[i][j]。
递推公式:
- 如果word1[i - 1] == word2[j - 1],那么dp[i][j] = dp[i - 1][j - 1]
- 如果word1[i - 1] != word2[j - 1]
– word1删除一个元素,次数为dp[i][j] = dp[i - 1][j] + 1
– word2删除一个元素,次数为dp[i][j] = dp[i][j - 1] + 1
– word1替换末尾元素,使其与word2相同,次数为dp[i][j] = dp[i - 1][j - 1] + 1
– 以上三者取最小值
代码
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 i = 0; i <= word2.size(); i++)
dp[0][i] = i;
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, min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1));
}
}
}
return dp[word1.size()][word2.size()];
}
};