题意:给定两个字符串s,t,现可对其中任意字符串做增、删、改操作,问将两字符串修改至相同需要的最小操作数;
传送门
输入:word1 = “horse”, word2 = “ros”
输出:3
解释:
horse -> rorse (将 ‘h’ 替换为 ‘r’)
rorse -> rose (删除 ‘r’)
rose -> ros (删除 ‘e’)
输入:word1 = “intention”, word2 = “execution”
输出:5
解释:
intention -> inention (删除 ‘t’)
inention -> enention (将 ‘i’ 替换为 ‘e’)
enention -> exention (将 ‘n’ 替换为 ‘x’)
exention -> exection (将 ‘n’ 替换为 ‘c’)
exection -> execution (插入 ‘u’)
题解:动态规划,dp[i][j]表示word1前i个字符与word2前j个字符修改成一致的操作数。
int minDistance(string word1, string word2) {
int n = word1.length(), m = word2.length();
if (n * m == 0) return n + m;
vector<vector<int>> dp(n+1, vector<int>(m+1));
for (int i = 0; i <= n; i++)
dp[i][0] = i;
for (int j = 0; j <= m; j++)
dp[0][j] = j;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int left = dp[i-1][j] + 1;
int down = dp[i][j-1] + 1;
int left_down = dp[i-1][j-1];
if (word1[i-1] != word2[j-1]) ++left_down;
dp[i][j] = min(left, min(down, left_down));
}
}
return dp[n][m];
}