Leetcode: Distinct Subsequences

Given a string S and a string T, count the number of distinct subsequences ofT 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.

distinct[i][j]表示S的前i位和T的前j位的 Distinct Subsequences 个数。

distinct[i][j] = (S[i]==T[j])?distinct[i-1][j]+distinct[i-1][j-1]:distinct[i-1][j] 

public class Solution {
    public int numDistinct(String S, String T) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int ns = S.length();
		int nt = T.length();
		if (ns < nt)
			return 0;
		int[][] counter = new int[ns + 1][nt + 1];
		for (int i = 0; i < ns; i++)
			counter[i][0] = 1;
		for (int i = 1; i <= ns; i++) {
			for (int j = 1; j <= nt; j++) {
				if (i < j)
					counter[i][j] = 0;
				else {
					if (S.charAt(i - 1) == T.charAt(j - 1))
						counter[i][j] = counter[i - 1][j - 1]
								+ counter[i - 1][j];
					else
						counter[i][j] = counter[i - 1][j];
				}
			}
		}
		return counter[ns][nt];
	}
}

修改下少遍历半个矩阵

public class Solution {
    public int numDistinct(String S, String T) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int ns = S.length();
		int nt = T.length();
		if (ns < nt)
			return 0;
		int[][] counter = new int[ns + 1][nt + 1];
		for (int i = 0; i <= ns; i++)
			counter[i][0] = 1;
		for (int j = 1; j <= nt; j++) {
			for (int i = j; i <= ns; i++) {
				if (S.charAt(i - 1) == T.charAt(j - 1))
					counter[i][j] = counter[i - 1][j - 1] + counter[i - 1][j];
				else
					counter[i][j] = counter[i - 1][j];
			}
		}
		return counter[ns][nt];
	}
}