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
.
二维动态规划,画出二维表。
r a b b i t
1 0 0 0 0 0 0
r 1
a 1
b 1
b 1
b 1
i 1
t 1
问题就转为从左上角只能走对角(匹配)或者往下(删除字符),到右下角一共有多少种走法。
transArray[i][0]初始化为1的含义是:任何长度的S,如果转换为空串,那就只有删除全部字符这1种方式。
当S[i-1]==T[j-1],说明可以从transArray[i-1][j-1]走对角到达transArray[i][j](S[i-1]匹配T[j-1]),此外还可以从transArray[i-1][j]往下到达transArray[i][j](删除S[i-1])
当S[i-1]!=T[j-1],说明只能从transArray[i-1][j]往下到达transArray[i][j](删除S[i-1])
class Solution {
public:
int numDistinct(string s, string t) {
int m = s.length();
int n = t.length();
vector<vector<int> > Dp(m+1,vector<int>(n+1,0));
//Dp[i][j]表示S前i个字符中含有T的前j个字符的个数
for(int i=0; i<=m; ++i){
Dp[i][0] = 1; //初始化,当t为零时说明任何s都可以删除所有元素到达t
}
for(int i=1; i<=m; ++i){
for(int j=1; j<=n; ++j){
if(s[i-1] == t[j-1])
//如果相等,画出二维Dp,说明此时可以从斜对角线走,或者从上方走下来。不相等只能从上方走下来
Dp[i][j] = Dp[i-1][j] + Dp[i-1][j-1];
else
Dp[i][j] = Dp[i-1][j];
}
}
return Dp[m][n];
}
};