leetcode---distinct subsequences---dp

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.

class Solution {
public:
    int numDistinct(string S, string T) 
    {
        int nS = S.size();
        int nT = T.size();
        if(nS < nT)
            return 0;
        if(nT == 0)
            return 1;

        vector< vector<int> > dp(nS+1, vector<int>(nT+1, 0));
        for(int i=0; i<nS; i++)
            dp[i][0] = 1;

        for(int i=1; i<=nS; i++)
        {
            for(int j=1; j<=nT; j++)
            {
                if(S[i-1] == T[j-1])
                    dp[i][j] = dp[i-1][j-1] + dp[i-1][j];
                else
                    dp[i][j] = dp[i-1][j];
            }
        }

        return dp[nS][nT];
    }
};