leetcode: distinct-subsequences

题目描述:

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

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).

Here is an example: S ="rabbbit", T ="rabbit"

Return3.

解题思路：

1. 首先理解题意，这道题的意思就是说给定字符串 S 和字符串 T，在 S 中存在多少个子字符串是与 T 相同的
2. 如题目中的 “rabbbit” 中存在 3 个字符串与 “rabbit” 相同
3. 一般关于字符串求子字符串的问题，都建议用动态规划求解
4. 设置一个动态数组 dp[i][j],i 表示 T 中 0~i 的字符串，j 表示 S 中 0~j 的字符串，数组中的值就是表示当前子字符串的个数
5. 画出状态转移表，即可得到动态转移方程为：首先默认 dp[i][j] = dp[i][j - 1],然后，如果当前两个字符相等的话，dp[i][j] += dp[i - 1][j - 1]

代码如下：

public int numDistinct(String S, String T) {
        if(S == null || T == null || S.length() == 0 || T.length() == 0 || S.length() < T.length())
            return 0;

        int lenS = S.length();
        int lenT = T.length();
        int [][] dp = new int[lenT + 1][lenS + 1];
        for(int i = 0; i <= lenS; i++) dp[0][i] = 1;
        for(int i = 1; i <= lenT; i++) dp[i][0] = 0;

        for(int i = 1; i <= lenT; i++){
            for(int j = 1; j <= lenS; j++){
                dp[i][j] = dp[i][ j - 1];
                if(T.charAt(i-1) == S.charAt(j-1))
                    dp[i][j] += dp[i-1][j - 1];

            }
        }
        return dp[lenT][lenS];
    }

转载于:https://my.oschina.net/happywe/blog/3081797