问题描述:
给你两个单词word1和word2, 请你计算出将word1和word2所使用的最少操作数。
你可以对一个单词进行如下三种操作:
1、插入一个字符
2、删除一个字符
3、替换一个字符
示例1:
输入: word1 = “horse”, word2 = “ros”
输出:3
解释:
horse -> rorse(将 “h” 替换为"r")
rorse -> rose(删除"r")
rose -> ros (删除"e")
思路
若当前字母相同,则:
dp[i][j] = dp[i - 1][j - 1];
否则取增删替三个操作的最小值 + 1,即:
dp[i][j] = 1 + Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]);
代码
public int minDistance(String word1, String word2) {
int len1 = word1.length(), len2 = word2.length();
int[][] dp = new int[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.charAt(i - 1) == word2.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1];
} else {
dp[i][j] = 1 + Math.min(Math.min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]);
}
}
}
return dp[len1][len2];
}