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
.
题目大意;
对字符串s进行删除操作(可以删除0个),使得有多少种不同的删除方法,最后得到字符串t
动态规划
对于dp[i,j]
假设 s[i] == t[j], 则dp[i][j] = dp[i-1][j-1] + dp[i-1][j] 这里表示,若s的字符与t的相同,那么可以删除s中的这个字符,也可以保留这个字符,因此有两种方式;
假设 s[i] != t[j], 则dp[i][j] = dp[i-1][j] 如果当前字符不相等,则只能删除s中的这个字符
初始化: dp[0][0] = 1 表示空串转换为空串,删除0个字符,即有一种方法;
dp[i][0] = 1 表示对于s中的每个字符转为空串,只能删除字符,即一种方法;
dp[0][j] = 0 表示对于空串转为有字符的子串,没有任何方法,因此为0
下面是代码:
class Solution {
public:
int numDistinct(string s, string t) {
int row = s.size(), col = t.size();
if(row == 0 || col == 0) return 0;
if(row < col) return 0;
vector<vector<int>>num(row+1, vector<int>(col+1,0));
num[0][0] = 1;
for(int i = 1; i <= row; i++)
num[i][0] = 1;
for(int i = 1; i <= row; i++){
for(int j = 1; j <= col; j++){
if(s[i-1] == t[j-1])
num[i][j] = num[i-1][j-1] + num[i-1][j];
else
num[i][j] = num[i-1][j];
}
}
return num[row][col];
}
};