题目
【hard】给你两个单词 word1 和 word2, 请返回将 word1 转换成 word2 所使用的最少操作数 。
你可以对一个单词进行如下三种操作:
- 插入一个字符
- 删除一个字符
- 替换一个字符
(0 <= word1.length, word2.length <= 500; word1 和 word2 由小写英文字母组成)
示例1:
输入:word1 = “horse”, word2 = “ros”
输出:3
解释:
horse -> rorse (将 ‘h’ 替换为 ‘r’)
rorse -> rose (删除 ‘r’)
rose -> ros (删除 ‘e’)
示例2:
输入:word1 = “intention”, word2 = “execution”
输出:5
解释:
intention -> inention (删除 ‘t’)
inention -> enention (将 ‘i’ 替换为 ‘e’)
enention -> exention (将 ‘n’ 替换为 ‘x’)
exention -> exection (将 ‘n’ 替换为 ‘c’)
exection -> execution (插入 ‘u’)
思路
动态规划求解思路:
- 确定dp数组含义: d p [ i ] [ j ] dp[i][j] dp[i][j]表示字符串 s 1 [ 0... i − 1 ] s1[0...i-1] s1[0...i−1]与 s 2 [ 0... j − 1 ] s2[0...j-1] s2[0...j−1]的编辑距离为 d p [ i ] [ j ] dp[i][j] dp[i][j];
- 确定base case:空字符串与任意非空字符串的编辑距离为该非空字符串长度;
– 当 i = 0 i = 0 i=0时, d p [ 0 ] [ j ] = j dp[0][j] = j dp[0][j]=j;
– 当 j = 0 j = 0 j=0时, d p [ i ] [ 0 ] = i dp[i][0] = i dp[i][0]=i; - 确定状态转移公式:由于
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]表示的是串
s
1
[
0...
i
−
1
]
s1[0...i-1]
s1[0...i−1]与
s
2
[
0...
j
−
1
]
s2[0...j-1]
s2[0...j−1]的编辑距离,这两个串的编辑操作的所有可能情况有:
– 当前字符 s 1 [ i − 1 ] = = s 2 [ j − 1 ] s1[i-1] == s2[j - 1] s1[i−1]==s2[j−1],不需要任何操作,距离与去掉 s 1 [ i − 1 ] s1[i-1] s1[i−1], s 2 [ j − 1 ] s2[j-1] s2[j−1]一样,即 d p [ i ] [ j ] = d p [ i − 1 ] [ j − 1 ] dp[i][j] = dp[i -1][j -1] dp[i][j]=dp[i−1][j−1];
– 当前字符 s 1 [ i − 1 ] ! = s 2 [ j − 1 ] s1[i-1] != s2[j - 1] s1[i−1]!=s2[j−1],则一定需要某种编辑操作转换得到:
(1) d p [ i ] [ j ] = d p [ i − 1 ] [ j ] + 1 dp[i][j] = dp[i - 1][j] + 1 dp[i][j]=dp[i−1][j]+1,字符串s1删除当前字符
(2) d p [ i ] [ j ] = d p [ i ] [ j − 1 ] + 1 dp[i][j] = dp[i][j - 1] + 1 dp[i][j]=dp[i][j−1]+1,字符串s1插入一个字符
(3) d p [ i ] [ j ] = d p [ i − 1 ] [ j − 1 ] + 1 dp[i][j] = dp[i - 1][j - 1] + 1 dp[i][j]=dp[i−1][j−1]+1,字符串s1替换掉当前字符
共有三种取其最小值,即 d p [ i ] [ j ] = m i n ( d p [ i − 1 ] [ j ] + 1 , d p [ i ] [ j − 1 ] + 1 , d p [ i − 1 ] [ j − 1 ] + 1 ) dp[i][j] = min (dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1 ) dp[i][j]=min(dp[i−1][j]+1,dp[i][j−1]+1,dp[i−1][j−1]+1) - 举例DP table:
以word1 = “horse”, word2 = "ros"为例
代码实现(C++)
class Solution {
public:
int minDistance(string word1, string word2) {
int m = word1.size(), n = word2.size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1)); //s1[0..m-1],s2[0...n-1]的ED是dp[m][n]
//base case
for (int i = 1; i <= m; i++) dp[i][0] = i;
for (int j = 1; j <= n; j++) dp[0][j] = j;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (word1[i - 1] == word2[j - 1]) dp[i][j] = dp[i - 1][j - 1]; //什么都不做
else {
dp[i][j] = mymin(dp[i - 1][j] + 1, //删除
dp[i][j - 1] + 1, //插入
dp[i - 1][j - 1] + 1); //替换
}
}
}
for (int i = 0; i < m + 1; i++) {
for (int j = 0; j < n + 1; j++) {
cout << dp[i][j] << " ";
if (j == n) cout << endl;
}
}
return dp[m][n];
}
int mymin(int a, int b, int c) {
return min(a, min(b, c));
}
};