代码随想录打卡-动态规划之编辑距离总结篇

一、判断子序列

392.判断子序列

class Solution {
    public boolean isSubsequence(String s, String t) {
        char[] ch1 = s.toCharArray();
        char[] ch2 = t.toCharArray();
        int[][] dp = new int[ch1.length+1][ch2.length+1];
        for(int i = 1;i<ch1.length+1;i++){
            for(int j = 1;j<ch2.length+1;j++){
                if(ch1[i-1]==ch2[j-1]){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else{
                    dp[i][j] = dp[i][j-1];
                }
            }
        }
        return dp[ch1.length][ch2.length]==ch1.length;
    }
}

二、不同的子序列

115.不同的子序列

注意初始化环节！

class Solution {
    public int numDistinct(String s, String t) {
        //相等：考虑取或不取
        //不相等：只用考虑不取
        char[] ch1 = s.toCharArray();
        char[] ch2 = t.toCharArray();
        int[][] dp = new int[ch1.length+1][ch2.length+1];
        //初始化
        dp[0][0] = 1;
        for(int i = 1;i<ch1.length+1;i++){
            dp[i][0] = 1;
        }
        for(int i = 1;i<ch1.length+1;i++){
            for(int j = 1;j<ch2.length+1;j++){
                if(ch1[i-1]==ch2[j-1]){
                    dp[i][j] = dp[i-1][j-1]+dp[i-1][j];
                }else{
                    dp[i][j] = dp[i-1][j];
                }
            }
        }
        return dp[ch1.length][ch2.length];
    }
}

三、两个字符串的删除操作

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

class Solution {
    public int minDistance(String word1, String word2) {
        char[] ch1 = word1.toCharArray();
        char[] ch2 = word2.toCharArray();
        int[][] dp = new int[ch1.length+1][ch2.length+1];
        
        for(int i = 1;i<ch1.length+1;i++){
            for(int j = 1;j<ch2.length+1;j++){
                if(ch1[i-1]==ch2[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 ch1.length+ch2.length-2*dp[ch1.length][ch2.length];
    }
}

四、编辑距离

72.编辑距离

class Solution {
    public int minDistance(String word1, String word2) {
        char[] ch1 = word1.toCharArray();
        char[] ch2 = word2.toCharArray();
        int[][] dp = new int[ch1.length+1][ch2.length+1];
        //初始化
        for(int i = 1;i<ch1.length+1;i++){
            dp[i][0] = i;
        }
        for(int i = 1;i<ch2.length+1;i++){
            dp[0][i] = i;
        }
        for(int i = 1;i<ch1.length+1;i++){
            for(int j = 1;j<ch2.length+1;j++){
                if(ch1[i-1]==ch2[j-1]){
                    //相等，不用改变
                    dp[i][j] = dp[i-1][j-1];
                }else{
                    //不相等：删、增、换
                    //其中，word1增相当于word2删
                    dp[i][j] = Math.min(Math.min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1])+1;
                }
            }
        }
        return dp[ch1.length][ch2.length];
    }
}