代码随想录Day56

最新推荐文章于 2024-06-20 19:01:05 发布

二手木乃伊

最新推荐文章于 2024-06-20 19:01:05 发布

阅读量191

点赞数 3

文章标签：代码随想录 java 动态规划

本文链接：https://blog.csdn.net/qq_45655634/article/details/137841601

版权

Day 56

今日任务

1. 两个字符串的删除操作
1. 编辑距离
编辑距离总结篇

代码实现

两个字符串的删除操作
这道题勉强可以算通过自己的思考出来的递推公式和初始化方式

    public int minDistance1(String word1, String word2) {
        char[] word1Array = word1.toCharArray();
        char[] word2Array = word2.toCharArray();
        int[][] dp = new int[word1.length() + 1][word2.length() + 1];
        for (int i = 0; i < dp.length; i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i < dp[0].length; i++) {
            dp[0][i] = i;
        }
        for (int i = 1; i <= word1Array.length; i++) {
            for (int j = 1; j <= word2Array.length; j++) {
                if (word1Array[i - 1] == word2Array[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[word1.length()][word2.length()];

    }

编辑距离
怎么看也比上边那到题复杂了很多，但是实际上只改了一行代码

    public int minDistance(String word1, String word2) {
        char[] word1Array = word1.toCharArray();
        char[] word2Array = word2.toCharArray();
        int[][] dp = new int[word1.length() + 1][word2.length() + 1];
        for (int i = 0; i < dp.length; i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i < dp[0].length; i++) {
            dp[0][i] = i;
        }
        for (int i = 1; i <= word1Array.length; i++) {
            for (int j = 1; j <= word2Array.length; j++) {
                if (word1Array[i - 1] == word2Array[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[word1.length()][word2.length()];
    }