LeetCode【distinct-subsequences】

思路：（动态规划）
a[i][j] 表示T[0,j]在S[0,i]中的匹配个数
如果不使用S[i],那么a[i][j] = a[i-1][j]
如果使用S[i],那么一定是S[i]==T[j],那么a[i][j] = a[i-1][j-1]
故：
1、S[i]==T[j]
a[i][j] = a[i-1][j]+a[i-1][j-1]
2、S[i]!=T[j]
a[i][j] = a[i-1][j]

#include <iostream>
#include <string>

using namespace std;

class Solution {
public:
    int numDistinct(string S, string T) {
        int n = S.size();
        int m = T.size();
        if (n < m)
            return 0;
        int **a;
        a = new int*[n + 1];
        for (int i = 0; i <= n; i++)
        {
            a[i] = new int[m + 1];
            memset(a[i], 0, sizeof(int)*(m+1));
        }
        a[0][0] = 1;
        //任意一个字符串变换成一个空串都只有一种变换方法
        for (int i = 0; i <= n; i++)
            a[i][0] = 1;
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                if (S[i-1] == T[j-1])
                {
                    a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
                }
                else
                    a[i][j] = a[i - 1][j];
            }
        }
        for (int i = 0 ; i <= n; i++)
            delete(a[i]);
        delete a;
        return a[n][m];
    }
};

int main()
{
	string a = "rabbbit";
	string b = "rabbit";
	Solution S;
	cout << S.numDistinct(a, b) << endl;
	system("pause");
	return 0;
}