LeetCode Distinct Subsequences

 //  136ms 过大的
 1 int f[100][11000];
class Solution {
public:
    int numDistinct(string S, string T) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        memset(f,0,100*11000);
        
        int i,j;
        const char *s=S.c_str();
        const char *t=T.c_str();
        for(i=0;i<11000;i++)
        {
            f[0][i]=1;
        }
        
        for(i=0;t[i];i++)
        {
            for(j=0;s[j];j++)
            {
                if(t[i]==s[j])
                {
                    f[i+1][j+1]=f[i+1][j]+f[i][j];
                }
                else
                {
                    f[i+1][j+1]=f[i+1][j];
                }
            }
        }
        return f[i][j];
    }
};