【代码随想录Day55 动态规划part15】392.判断子序列、115.不同的子序列

Day55

392.判断子序列

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

115.不同的子序列

class Solution {
     public int numDistinct(String s, String t) {
        int n = s.length();
        int m = t.length();
        int dp[][] = new int[n + 1][m + 1];
        for (int i = 0; i <= n; i++) dp[i][0] = 1;
        for (int i = 1; i <=n; i++) {
            char char1 = s.charAt(i -1);
            for (int j = 1; j <= m; j++) {
                char char2 = t.charAt(j - 1);
                if (char1 == char2) dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
                else dp[i][j] = dp[i - 1][j];
            }
        }
        return dp[n][m];
    }
}