一、题目
二、代码
class Solution
{
public int numDistinct(String s, String t)
{
int i,j;
int length_s;
int length_t;
length_s = s.length();
length_t = t.length();
int[][] dp = new int[length_s+1][length_t+1];
for(i=0;i<=length_s;i++)
{
dp[i][0] = 1;
}
for(i=1;i<=length_s;i++)
{
for(j=1;j<=length_t;j++)
{
if(s.charAt(i-1)==t.charAt(j-1))
{
dp[i][j] = dp[i-1][j-1] + dp[i-1][j];
}
else
{
dp[i][j] = dp[i-1][j];
}
}
}
return dp[length_s][length_t];
}
}