Leetcode 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.

---

dp[i][j]
1. if s[i]==s[j], dp[i-1][j-1]+dp[i-1][j]
2.if s[i]!=s[j], dp[i-1][j]
初始化dp[i][0] (0<=i

public class Solution {
    public int numDistinct(String s, String t) {
        if(t.length()>s.length())return 0;
        if(t.length()==s.length()) return s.equals(t) ? 1:0;
        int m=s.length(), n=t.length();
        int dp[][]=new int[m][n];
        dp[0][0] = s.charAt(0) == t.charAt(0) ? 1: 0;
        for(int i=1;i<m;i++)
        {
            if(s.charAt(i)==t.charAt(0))dp[i][0]=dp[i-1][0]+1;
            else dp[i][0]=dp[i-1][0];
        }
        for(int i=1;i<m;i++)
        {
            for(int j=1;j<=i&&j<n;j++)
            {
                if(j==i)dp[i][j]= s.substring(0,i+1).equals(t.substring(0,j+1)) ? 1 : 0;
                else
                {
                    int x= s.charAt(i)==t.charAt(j) ? 1:0;
                    dp[i][j]= x* dp[i-1][j-1] + dp[i-1][j];
                }
            }
        }
        return dp[m-1][n-1];
    }
}

/*
test cases
"", ""
1,12
"",1
1,""
rabbbit,rabbit
*/