392. 判断子序列
题目连接
笔记
class Solution {
public:
bool isSubsequence(string s, string t) {
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1, 0));
for (int i = 1; i < dp.size(); i++) {
for (int j = 1; j < dp[0].size(); j++) {
if (s[i - 1] == t[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
else dp[i][j] = dp[i][j - 1];
}
}
if (dp.back().back() == s.size()) return true;
else return false;
}
};
115. 不同的子序列
题目连接
笔记
class Solution {
public:
int numDistinct(string s, string t) {
vector<vector<uint64_t>> dp(t.size() + 1, vector<uint64_t>(s.size() + 1, 0));
for (int i = 0; i < dp[0].size(); i++) {
dp[0][i] = 1;
}
for (int i = 1; i < dp.size(); i++) {
for (int j = 1; j < dp[0].size(); j++) {
if (s[j - 1] == t[i - 1]) {
dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1];
}
else {
dp[i][j] = dp[i][j - 1];
}
}
}
return dp.back().back();
}
};