难度:hard
题目:
被hard程度吓到了,首先想到的是用递归求解,写了一个多小时没做出来,其实是一个简单的动态规划
AC解:
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[0][0] = 1;
//空串是s的子串
for (int i = 0; i < m; i++)
dp[i + 1][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++) {
if (s[i - 1] == t[j - 1])
//包含t[j - 1]和不包含t[j - 1]
dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
else
dp[i][j] = dp[i - 1][j];
}
return dp[m][n];
}
};