题目要求如下:
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:
a) Insert a character
b) Delete a characterg
c) Replace a character
其实这题的核心思想并不难,但是我即使知道这题用dp,仍然没有想到如何构建模型。。。不过这道题的代码难度充其量就是medium水平
算法:
举一个例子:
word1 = "abcd"
word2 = "bcda"
要想得到“abcd”和"bcda"的差距,
先检测最后一位"d"和"a"是否相等,如果想等,"abcd"和"bcda"的差距其实就是"abc"和"bcd"的差距,
但是,在本题中,显然不等,所以要在三个值里面选最小值,
(1)“abc”和"bcda"的差距,在此之后进行insert操作
(2)“abc”和"bcd"的差距,在此之后进行replace操作
(3)“abcd”和"bcd"的差距,在此之后delete操作
如果大家熟悉DP的话,上面就已经构成了一个DP的模型,剩下的就是简单的编程了。。纯在代码难度上看,本题完全和LRU cache等没法比,但是仍然难住了我。
希望能借此加深对DP的理解吧
完整代码如下:
class Solution {
public:
int minDistance(string word1, string word2) {
int len1 = word1.length();
int len2 = word2.length();
vector<vector<int>> dp(len1+1, vector<int>(len2+1, 0));
//int dp[len1+1][len2+1];
int i, j;
for (i = 0; i <= len1; ++i)
dp[i][0] = i;
for (i = 0; i <= len2; ++i)
dp[0][i] = i;
for (i = 1; i <= len1; ++i) {
for (j = 1; j <= len2; ++j) {
if (word1[i-1] == word2[j-1])
dp[i][j] = dp[i-1][j-1];
else
dp[i][j] = 1 + min(dp[i-1][j], min(dp[i][j-1], dp[i-1][j-1]));
}
}
return dp[len1][len2];
}
};