代码随想录算法训练营day45|115.不同的子序列、583. 两个字符串的删除操作、72. 编辑距离

115.不同的子序列

        这题第一次理解还是很难的，看代码随想录看不懂，去看了b站的视频才明白。明白了思想代码就很容易了。

class Solution {
    public int numDistinct(String s, String t) {
        char[] fa = s.toCharArray();
        char[] so = t.toCharArray();

        int[][] dp = new int[so.length+1][fa.length+1];
        for(int j = 0; j<=fa.length; j++){
            dp[0][j] = 1;
        }

        for(int i = 1; i <=so.length; i++){
            for(int j = 1; j<=fa.length; j++){
                if(fa[j-1] == so[i-1]){
                    dp[i][j] = dp[i-1][j-1] + dp[i][j-1];
                }else{
                    dp[i][j] = dp[i][j-1];
                }
                
            }
        }
        /*/打印dp数组
        for(int i = 0; i<=so.length;i++){
            for(int j = 0; j<=fa.length; j++){
                System.out.print(dp[i][j]+" ");
            }
            System.out.println();
        }
        //*/
        return dp[so.length][fa.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 = 0; i <=ch1.length; i++){
            dp[i][0] = i;
        }
        for(int j = 0; j<=ch2.length; j++){
            dp[0][j] = j;
        }

        for(int i = 1; i<=ch1.length; i++){
            for(int j = 1; j<=ch2.length; j++){
                if(ch1[i-1] == ch2[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[ch1.length][ch2.length];
    }
}

72. 编辑距离

class Solution {
    public int minDistance(String word1, String word2) {
        char[] w1 = word1.toCharArray();
        char[] w2 = word2.toCharArray(); 
        int[][] dp = new int[w1.length+1][w2.length+1];
        for(int i = 0 ; i <= w1.length;i++){
            dp[i][0] = i;
        }
        for(int j = 0; j<=w2.length;j++){
            dp[0][j] = j;
        }

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