72. Edit Distance
方法:
1. 动态规划方法
2. dp[i][j] 表示word1前i个字符转到word2前j个字符所需的步骤
3. 如果word1.charAt(i) == word2.charAt(j) dp[i][j] == dp[i - 1][j - 1];, 否则dp[i][j] = 1 + min(dp[i][j - 1], dp[i - 1][j], dp[i - 1][j - 1]),其中dp[i][j - 1] = 表示用插入操作, dp[i - 1][j]表示用删除操作,dp[i - 1][j - 1] 表示用替换操作。
4. dp初始化dp[0, k] = dp [k , 0] = k。
代码:
public class Solution {
public int minDistance(String word1, String word2) {
int m = word1.length();
int n = word2.length();
int[][] matrix = new int[m + 1][n + 1];
for(int i = 0; i <= m; i++){
matrix[i][0] = i;
}
for(int i = 0; i <= n; i++){
matrix[0][i] = i;
}
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if(word1.charAt(i) == word2.charAt(j)){
matrix[i + 1][j + 1] = matrix[i][j];
}
else{
int a = matrix[i + 1][j];
int b = matrix[i][j + 1];
int c = matrix[i][j];
int min = Math.min(a, b);
matrix[i + 1][j + 1] = Math.min(min, c) + 1;
}
}
}
return matrix[m][n];
}
}