目录
583 两个字符串的删除操作
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>>dp(word1.size() + 1,vector<int>(word2.size() + 1));//使得word1的前i个与word2的前j个相同所需的最小步数
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] = min(dp[i][j - 1] + 1,dp[i - 1][j] + 1);
}else{
dp[i][j] = dp[i - 1][j - 1];
}
}
}
return dp[word1.size()][word2.size()];
}
};
时间复杂度O(n×m)
空间复杂度O(n×m)
72 编辑距离
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>>dp(word1.size() + 1,vector<int>(word2.size() + 1));//将word1的前i个字符转换为word2的前j个字符所使用的最小操作数
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++){
dp[i][j] = min(dp[i - 1][j],dp[i][j - 1]) + 1;//增和删
if(word1[i - 1] != word2[j - 1]){
dp[i][j] = min(dp[i - 1][j - 1] + 1,dp[i][j]);
}else{
dp[i][j] = min(dp[i - 1][j - 1],dp[i][j]);
}
}
}
return dp[word1.size()][word2.size()];
}
};
时间复杂度O(n×m)
空间复杂度O(n×m)