Day 56 | 583. Delete Operation for Two Strings | 72. Edit Distance

王锴KKKKKKyle

已于 2023-08-16 23:17:55 修改

阅读量111

点赞数

分类专栏： LeetCode 文章标签： java leetcode 算法

于 2023-08-07 12:37:27 首次发布

本文链接：https://blog.csdn.net/kyle313606922/article/details/132114441

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

583. Delete Operation for Two Strings

Question Link

Solution 1

class Solution {
    public int minDistance(String word1, String word2) {
        char[] char1 = word1.toCharArray();
        char[] char2 = word2.toCharArray();
        int[][] dp = new int[char1.length+1][char2.length+1];
        int len = 0; // length of longest common subsequence
        for(int i = 1; i <= char1.length; i++){
            for(int j = 1; j <= char2.length; j++){
                if(char1[i-1] == char2[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]);
                len = Math.max(len, dp[i][j]);
            }
        }
        return char1.length + char2.length - len*2;
    }
}

This solution stores the length of longest common subsequence on the dp array.
We could calculate the length of longest common subsequence first. Then the minimum number of steps is as follows:
- word1.length() + word2.length() - len * 2

Solution 2

class Solution {
    public int minDistance(String word1, String word2) {
        char[] char1 = word1.toCharArray();
        char[] char2 = word2.toCharArray();
        int[][] dp = new int[char1.length+1][char2.length+1];
        for(int i = 0; i <= char1.length; i++) dp[i][0] = i;
        for(int j = 0; j <= char2.length; j++) dp[0][j] = j;
        
        for(int i = 1; i <= char1.length; i++){
            for(int j = 1; j <= char2.length; j++){
                if(char1[i-1] == char2[j-1])
                    dp[i][j] = dp[i-1][j-1];
                else
                    dp[i][j] = Math.min(dp[i-1][j] + 1, dp[i][j-1] + 1);
            }
        }
        return dp[char1.length][char2.length];
    }
}

This solution stores the number of character that need to delete on the dp array.
dp[i][j]: The minimum number of delete operations required to make word1 ends with i-1 and word2 ends with j-1 the same.
Recursive Formula
- When word1[i-1] is the same as word2[j-1]:
  - dp[i][j] = dp[i-1][j-1]
- When word1[i-1] is different from word2[j-1]:
  - Delete word1[i-1], minimum number of operations: dp[i][j] = dp[i-1][j] + 1
  - Delete word2[j-1], minimum number of operations: dp[i][j] = dp[i][j-1] + 1
  - Delete word1[i-1] and word2[j-1], minimum number of operations: dp[i][j] = dp[i-1][j-1] + 2. We do not consider this case, cause dp[i][j-1] already disregarded word2[j - 1]. So when we delete word1[i-1], we can achieve the effect of deleting both elements. That is dp[i][j-1] + 1.
Array Initialization
- dp[i][0] = i, cause any word1 have to delete i elements to be a empty string.
- dp[0][j] = j, cause any word2 have to delete j elements to be a empty string.

72. Edit Distance

Question Link

class Solution {
    public int minDistance(String word1, String word2) {
        char[] char1 = word1.toCharArray();
        char[] char2 = word2.toCharArray();
        int[][] dp = new int[char1.length + 1][char2.length + 1];

        for(int i = 1 ; i <= char1.length; i++) dp[i][0] = i;
        for(int j = 1; j <= char2.length; j++) dp[0][j] = j;

        for(int i = 1 ; i <= char1.length; i++){
            for(int j = 1; j <= char2.length; j++){
                if(char1[i-1] == char2[j-1])
                    dp[i][j] = dp[i-1][j-1];
                else
                    dp[i][j] = Math.min(dp[i-1][j-1], Math.min(dp[i-1][j], dp[i][j-1])) + 1;
            }
        }
        return dp[char1.length][char2.length];
    }
}

dp[i][j]: The minimum number of operations required to convert word1 ends with i-1 to word2 ends with j-1
Recursive Formula
- When word1[i-1] is the same as word2[j-1]:
  - dp[i][j] = dp[i-1][j-1]
- When word1[i-1] is different from word2[j-1]:
  - Delete/Insertword1[i-1], minimum number of operations: dp[i][j] = dp[i-1][j] + 1.
  - Delete/Insert word2[j-1], minimum number of operations: dp[i][j] = dp[i][j-1] + 1.
  - Replace word1[i-1] with word2[j-1], minimum number of operations: dp[i][j] = dp[i-1][j-1] + 1.
  - Chose the minimum one: dp[i][j] = Math.min(dp[i-1][j-1], Math.min(dp[i-1][j], dp[i][j-1])) + 1.
Array Initialization
- dp[i][0] = i, cause any word1 have to delete i elements to be an empty string or word2 has to insert i elements to be the same as word1
- dp[0][j] = j, cause any word2 have to delete j elements to be an empty string or word1 has to insert j elements to be the same as word2

王锴KKKKKKyle

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Day 56 | 583. Delete Operation for Two Strings | 72. Edit Distance

Day 56 | 583. Delete Operation for Two Strings | 72. Edit Distance
复制链接

扫一扫