Leetcode215: 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"

Return 3.

class Solution {
public:
    int numDistinct(string s, string t) {
        int n = t.size();
        vector<int> counter(n,0);
        for(int i=0; i<s.size(); i++){
            for(int j=n-1; j>=0; j--){
                if(t[j]==s[i]){
                    if(j) counter[j] += counter[j-1];
                    else counter[j]++;
                }
            }
        }
        return counter.back();
    }
};