问题:
Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.
Example 1:
Input: "sea", "eat" Output: 2 Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
Note:
- The length of given words won't exceed 500.
- Characters in given words can only be lower-case letters.
解决:
① 给定两个单词,问最少需要多少步可以让两个单词相等,每一步可以在任意一个单词中删掉一个字符。
动态规划解决,word2删除一个字符,和跟在word1对应的地方加上那个要删除的字符,达到的效果是一样的,并不影响最终的步骤数,dp[i][j]表示word1的前i个字符和word2的前j个字符组成的两个单词,能使其变相同的最小的步数 。
如果word1[i] == word2[j],则表示两个字符是相同的,则dp[i][j] = dp[i-1][j-1];
如果word1[i] != word2[j],则表示两个字符是不相同的,则dp[i][j] = min( dp[i-1][j], dp[i][j-1] ) + 1;
class Solution { //94ms
public int minDistance(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
int[][] dp = new int[len1 + 1][len2 + 1];
for (int i = 0;i <= len1;i ++){
dp[i][0] = i;
}
for (int j = 0;j <= len2;j ++){
dp[0][j] = j;
}
for (int i = 1;i <= len1;i ++){
for (int j = 1;j <= len2;j ++){
if (word1.charAt(i - 1) == word2.charAt(j - 1)){
dp[i][j] = dp[i - 1][j - 1];
}else{
dp[i][j] = Math.min(dp[i - 1][j],dp[i][j - 1]) + 1;
}
}
}
return dp[len1][len2];
}
}
② 实际上就是求两个字符串的相同部分,再用两个字符串的长度减去公共部分的长度 * 2,结果即为所求。
所以,本题实质上可以转换为求最长公共子序列。dp[i][j]表示word1的前i个字符和word2的前j个字符组成的两个单词的最长公共子序列的长度。
class Solution { //67ms
public int minDistance(String word1, String word2) {
int len1 = word1.length();
int len2 = word2.length();
int[][] dp = new int[len1 + 1][len2 + 1];
for (int i = 1;i <= len1;i ++){
for (int j = 1;j <= len2;j ++){
if (word1.charAt(i - 1) == word2.charAt(j - 1)){
dp[i][j] = dp[i - 1][j - 1] + 1;
}else {
dp[i][j] = Math.max(dp[i - 1][j],dp[i][j - 1]);
}
}
}
return len1 + len2 - 2 * dp[len1][len2];
}
}