import java.util.Arrays;
public class TwoStrDel {
public static void main(String[] args) {
// 2
System.out.println(minDistance("sea", "eat"));
// 4
System.out.println(minDistance("leetcode", "etco"));
// 4
System.out.println(minDistance("sea", "ate"));
}
private static int minDistance(String word1, String word2) {
int[][] dp = new int[word1.length() + 1][word2.length() + 1];
for (int i = 1; i <= word1.length(); i++) {
dp[i][0] = i;
}
for (int i = 1; i <= word2.length(); i++) {
dp[0][i] = i;
}
for (int i = 1; i <= word1.length(); i++) {
for (int j = 1; j <= word2.length(); j++) {
if (word1.charAt(i - 1) == word2.charAt(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]) + 1, dp[i - 1][j - 1] + 2);
// dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + 1;
}
}
}
return dp[word1.length()][word2.length()];
}
}
LeetCode 583 两个字符串的删除操作
于 2024-09-24 20:07:40 首次发布