题目描述:
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 character
c) Replace a character
用dp[i][j]表示word1的前i个字符和word2的前j个字符,则有下面三种情况:
1、dp[i][j-1]+1表示insert操作
2、dp[i-1]+1表示delete操作
3、replace操作分两种情况:a)word1[i]==word2[j]时取dp[i-1][j-1] b)word1[i]!=word2[j]时取dp[i-1][j-1]+1
dp[i][j]取上面三者的最小值。
代码:
class Solution {
public:
int minDistance(string word1, string word2) {
vector<vector<int>> dp(word1.length() + 1, vector<int>(word2.length() + 1, INT_MAX));
dp[0][0] = 0;
for (int i = 0; i <= word1.length(); i++)
for (int j = 0; j <= word2.length(); j++){
if (i)
dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
if (j)
dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1);
if (i&&j)
dp[i][j] = min(dp[i][j], (word1[i - 1] == word2[j - 1]) ? dp[i - 1][j - 1] : (dp[i - 1][j - 1] + 1));
}
return dp[word1.length()][word2.length()];
}
};