思路——动态规划
- dp[i][j]含义:代表以i为结尾下标,与以j结尾下标的字母之间的最小编辑距离
- 递推方程:4个操作,不动,word1增,word2增,替换元素
if(word[i-1]==word[j-1])
dp[i][j]=dp[i-1][j-1];
else
dp[i][j]=min(dp[i-1][j],dp[i][j-1],dp[i-1][j-1])+1;
- dp数组初始化:空字符与word1 word2的最小编辑距离
- 遍历顺序:从左至右,从上至下
- 返回结果:dp[word1.size()][word2.size()]
代码
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()];
}
};