题目描述
给定两个单词 word1 和 word2,计算出将 word1 转换成 word2 所使用的最少操作数 。
你可以对一个单词进行如下三种操作:
插入一个字符
删除一个字符
替换一个字符
示例 1:
输入: word1 = “horse”, word2 = “ros”
输出: 3
解释:
horse -> rorse (将 ‘h’ 替换为 ‘r’)
rorse -> rose (删除 ‘r’)
rose -> ros (删除 ‘e’)
示例 2:
输入: word1 = “intention”, word2 = “execution”
输出: 5
解释:
intention -> inention (删除 ‘t’)
inention -> enention (将 ‘i’ 替换为 ‘e’)
enention -> exention (将 ‘n’ 替换为 ‘x’)
exention -> exection (将 ‘n’ 替换为 ‘c’)
exection -> execution (插入 ‘u’)
解答
https://blog.csdn.net/ghsau/article/details/78903076
package 笔试.bilibili;
import java.util.Scanner;
public class Main1 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String str1 = scan.next();
String str2 = scan.next();
char[] s1 = str1.toCharArray();
char[] s2 = str2.toCharArray();
int index1 = s1.length;
int index2 = s2.length;
int[][] dp = new int[index1 + 1][index2 + 1];
for(int i = 1; i <= index2; i++) {
dp[0][i] = dp[0][i] = dp[0][i - 1] + 1;
}
for(int i = 1; i <= index1; i++) {
dp[i][0] = dp[i - 1][0] + 1;
}
for(int i = 1; i <= index1; i++) {
for(int j = 1; j <= index2; j++) {
if(s1[i - 1] == s2[j - 1]) {
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;
}
}
}
System.out.println(dp[index1][index2]);
}
}