用二维动态规划解决,代码如下
public class Solution {
public int numDistinct(String s, String t) {
int[][] dp = new int[t.length()+1][s.length()+1];
dp[0][0] = 1;
for(int i = 1; i <= t.length(); i++)
dp[i][0] = 0;
for(int j = 1; j <= s.length(); j++)
dp[0][j] = 1;
for(int i = 1; i <= t.length(); i++)
for(int j = 1; j <= s.length(); j++)
dp[i][j] = dp[i][j-1]+(t.charAt(i-1) == s.charAt(j-1) ? dp[i-1][j-1] : 0);
return dp[t.length()][s.length()];
}
}
参考Alf