给你两个单词 word1
和 word2
, 请返回将 word1
转换成 word2
所使用的最少操作数 。
你可以对一个单词进行如下三种操作:
- 插入一个字符
- 删除一个字符
- 替换一个字符
输入:word1 = "horse", word2 = "ros"
输出:3
解释:
horse -> rorse (将 'h' 替换为 'r')
rorse -> rose (删除 'r')
rose -> ros (删除 'e')
https://leetcode.cn/problems/edit-distancehttps://leetcode.cn/problems/edit-distance
public class LeetCode72AboutEditDistance {
public static void main(String[] args) {
String word1="fxpimu";
String word2="xwrs";
int result = minDistance(word1, word2);
System.out.println("编辑的最短距离是:"+result);
/*
[0, 1, 2, 3, 4]
[1, 1, 2, 3, 4]
[2, 1, 2, 3, 4]
[3, 2, 2, 3, 4]
[4, 3, 3, 3, 4]
[5, 4, 4, 4, 4]
[6, 5, 5, 5, 5]
编辑的最短距离是:5
*/
}
public static int minDistance(String word1, String word2) {
return process(word1,word2,1,1,1);
}
public static int process(String word1, String word2,int add,int delete,int modify) {
char[] str1 = word1.toCharArray();
char[] str2 = word2.toCharArray();
int N=str1.length+1;
int M=str2.length+1;
int[][] dp=new int[N][M];
dp[0][0]=0;
for (int i=1;i<N;i++){
dp[i][0]=i*delete;
}
for (int j=1;j<M;j++){
dp[0][j]=j*add;
}
for (int i=1;i<N;i++){
for (int j=1;j<M;j++){
if (str1[i-1]==str2[j-1]){
dp[i][j]=dp[i-1][j-1];
}else {
dp[i][j]=dp[i-1][j-1]+modify;
}
dp[i][j]=Math.min(dp[i][j],dp[i-1][j]+delete);
dp[i][j]=Math.min(dp[i][j],dp[i][j-1]+add);
}
}
for (int[]element:dp){
System.out.println(Arrays.toString(element));
}
return dp[N-1][M-1];
}
}