代码随想录算法训练营天第九章五十六天| 583. 两个字符串的删除操作 72. 编辑距离

最新推荐文章于 2024-06-27 17:45:24 发布

酷酷的贝吉塔

最新推荐文章于 2024-06-27 17:45:24 发布

阅读量37

点赞数

分类专栏：算法刷题文章标签：算法 leetcode 动态规划

本文链接：https://blog.csdn.net/weixin_44904677/article/details/129826828

版权

算法刷题专栏收录该内容

2 篇文章 0 订阅

订阅专栏

代码随想录算法训练营天第九章五十六天| 583. 两个字符串的删除操作 72. 编辑距离

583. 两个字符串的删除操作


class Solution {
    public int minDistance(String word1, String word2) {
        // 动态规划方法1，直接算  
        int[][] dp = new int[word1.length()+1][word2.length()+1];

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

class Solution {
    public int minDistance(String word1, String word2) {
        // 动态规划方法2，算最长子序列
        int[][] dp = new int[word1.length()+1][word2.length()+1];
        for (int i = 1; i <= word1.length(); i++) {
            char char1 = word1.charAt(i-1);
            for (int j = 1; j <= word2.length(); j++) {
                char char2 = word2.charAt(j-1);
                if (char1 == char2) {
                    dp[i][j] = dp[i-1][j-1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return word1.length()+word2.length() - dp[word1.length()][word2.length()]*2;
    }
}

72. 编辑距离

class Solution {
    public int minDistance(String word1, String word2) {
        int[][] dp = new int[word1.length()+1][word2.length()+1];
        for (int i = 0; i <= word1.length(); i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= word2.length(); j++) {
            dp[0][j] = j;
        }
        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(dp[i-1][j-1],Math.min(dp[i-1][j],dp[i][j-1])) + 1;
                }

            }
        }
        return dp[word1.length()][word2.length()];
    }
}