题目:
给你两个单词 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’)
提示:
0 <= word1.length, word2.length <= 500
word1 和 word2 由小写英文字母组成
思路:
读完题干发现是一个全局最优问题,并且最后返回的是一个数值,很明显的想到是dp问题。
代码:
import com.sun.deploy.util.StringUtils;
/**
* @Author puppet
* @Date 2022/3/18 15:30
**/
public class Leetcode {
public static int minDistance(String word1, String word2) {
int high = word1.length();
int row = word2.length();
char[] word1Arr = word1.toCharArray();
char[] word2Arr = word2.toCharArray();
int[][] dp = new int[high + 1][row + 1];
for (int i = 0; i <= row; i++){
dp[0][i] = i;
}
for (int i = 0; i <= high; i++){
dp[i][0] = i;
}
for(int i = 1; i <= high; i++){
for(int j = 1; j <= row; j++){
if(word1Arr[i - 1] == word2Arr[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;
}
}
}
return dp[high][row];
}
public static void main(String[] args) {
System.out.println(minDistance("", "a"));
}
}