leetcode_124 Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences of S which equals T.

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ACE" is a subsequence of "ABCDE" while "AEC" is not).

It's guaranteed the answer fits on a 32-bit signed integer.

Example 1:

Input: S = "rabbbit", T = "rabbit"Output: 3
Explanation:
As shown below, there are 3 ways you can generate "rabbit" from S.
(The caret symbol ^ means the chosen letters)
rabbbit ^^^^ ^^
rabbbit ^^ ^^^^
rabbbit ^^^ ^^^

Example 2:

Input: S = "babgbag", T = "bag"
Output: 5
Explanation:
As shown below, there are 5 ways you can generate "bag" from S.
(The caret symbol ^ means the chosen letters)
babgbag ^^ ^
babgbag ^^    ^
babgbag ^    ^^
babgbag   ^  ^^
babgbag     ^^^

算法解析，使用回溯法，符合条件的计数+1，这样时间复杂度比较高

使用dp[i][j]记录了访问i,j的可能的符合条件的数量，如果再次计算时，直接返回记录的值，剪枝节约了时间

DFS + Memorization + DP

代码如下：

class Solution {
public:
    vector<vector<int> > dp;
    int backtrace(string s,int i,string t,int j)
    {
        if(j == t.length())
            return 1;
        if(i == s.length())
            return 0;
        if(dp[i][j] != -1)
            return dp[i][j];
        int ans = 0;
        if(s[i] == t[j])
        {    
            ans += backtrace(s,i+1,t,j+1);
        }
        ans += backtrace(s,i+1,t,j);
        dp[i][j] = ans;
        return ans;
    }
    int numDistinct(string s, string t) {
        dp.clear();
        dp.resize(s.length());
        for(int i = 0; i < s.length(); i++)
        {
            dp[i].resize(t.length(),-1);
        }
        return backtrace(s,0,t,0);  
    }
};

 解法二：动态规划

代码如下：

class Solution {
public:
    int numDistinct(string s, string t) {
        int m = s.length();
        int n = t.length();
        long dp[n+1][m+1];
        for(int i = 0; i <= m; i++)
            dp[0][i] = 1;
        for(int j = 1; j <= n; j++)
            dp[j][0] = 0;
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < m; j++)
            {
                if(t[i] == s[j])
                    dp[i+1][j+1] = dp[i][j] + dp[i+1][j];
                else
                    dp[i+1][j+1] = dp[i+1][j];  
            }
        }
        return dp[n][m];
    }
};