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.

截取"bbb" 和 "bb" 出来填表。      0 b b0 1 0 0b 1 1 0b 1 2 1b 1 3 3

public class Solution {    public int numDistinct(String s, String t) {        int[][] table = new int[s.length() + 1][t.length() + 1];                for(int i=0;i