class Solution {
public int minDistance(String word1, String word2) {
int m = word1.length(), n = word2.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 0; i < m + 1; i++) {
dp[i][0] = i;
}
for (int i = 0; i < n + 1; i++) {
dp[0][i] = i;
}
for (int i = 1; i < m + 1; i++) {
char w1i = word1.charAt(i - 1);
for (int j = 1; j < n + 1; j++) {
char w2j = word2.charAt(j - 1);
if (w1i == w2j) {
dp[i][j] = dp[i - 1][j - 1];
} else {
dp[i][j] = Math.min(
Math.min(dp[i - 1][j], dp[i][j - 1]),
dp[i - 1][j - 1]
) + 1;
}
}
}
return dp[m][n];
}
}
72. 编辑距离
最新推荐文章于 2024-10-03 13:36:06 发布