[Leetcode] Distinct Subsequence

class Solution {

public:
    int numDistinct(string s, string t) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > mat(s.size() + 1, vector<int>(t.size() + 1));
        
        mat[0][0] = 1;
        for (int i = 1; i <= s.size(); ++i)
            mat[i][0] = 0;
            
        for (int i = 1; i <= t.size(); ++i)
            mat[0][i] = 0;
            
        for (int i = 1; i <= s.size(); ++i)
        {
            for (int j = 1; j <= t.size(); ++j)
            {
                if (s[i - 1] == t[j - 1])
                {
                    mat[i][j] = 0;
                    for (int k = 0; k < i; ++k)
                        mat[i][j] += mat[k][j - 1];
                }
                else
                    mat[i][j] = 0;
            }
        }
        
        int sum = 0;
        for (int i = 0; i <= s.size(); ++i)
            sum += mat[i][t.size()];
            
        return sum;
    }
};