问题描述:Word1要经过多少步操作才能变成Word2
操作:增加一个字符;删除一个字符;替换一个字符
思路:设dp[i][j]为将Word1前i个字符转换成Word2前j个字符所需操作步数,则问题转换为求dp[len1][len2]
dp[i][j]可以由以下几种路径得出:
1. 在已知dp[i-1][j]的情况下,Word1再删除一个字符
2. 在已知dp[i][j-1]的情况下,Word1再增加一个字符
3. 若Word1[i] == Word2[j],则在dp[i-1][j-1]上不用任何操作
3. 若Word1[i] != Word2[j],则在dp[i-1][j-1]上替换Word1[i] 为 Word2[j]
初始状态:
dp[i][0] = i
dp[0][j] = j
#include <algorithm>
using namespace std;
class Solution {
public:
int minDistance(string word1, string word2) {
int len1 = word1.size(), len2 = word2.size();
int dp[len1+1][len2+1];
for(int i = 0; i <= len1; i++){
dp[i][0] = i;//删除
}
for(int j = 0; j <= len2; j++){
dp[0][j] = j;//增加
}
for(int i = 1; i <= len1; i++){
for(int j = 1; j <= len2; j++){
if(word1[i-1] == word2[j-1])
dp[i][j] = min(dp[i][j-1] + 1, min(dp[i-1][j] + 1, dp[i-1][j-1]));
else
dp[i][j] = min(dp[i][j-1] + 1, min(dp[i-1][j] + 1, dp[i-1][j-1] + 1));
}
}
return dp[len1][len2];
}
};