392.判断子序列
392. Is Subsequence
知识点:动规
状态:不会
思路:
// d【i】【j】是到i-1,j-1的最长相同字串数
因为s是t的子序列,当i-1=j-1时,长度加一;当不等于时,相当于不要j-1这个数,长度跟到j-2的长度相同,即dp[i][j] = dp[i][j-1]
class Solution {
public:
bool isSubsequence(string s, string t) {
vector<vector<int>> dp(s.size()+1, vector<int>(t.size()+1, 0)); // d【i】【j】是到i-1,j-1的最长相同字串数
for(int i = 1; i <= s.size(); i++){
for(int j = 1;j <= t.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];
}
}
return dp[s.size()][t.size()] == s.size() ? true : false;
}
};
115.不同的子序列
115. Distinct Subsequences
知识点:动规
状态:不会
思路:等二刷
class Solution {
public:
int numDistinct(string s, string t) {
vector<vector<uint64_t>> dp(s.size() + 1, vector<uint64_t>(t.size() + 1));
for (int i = 0; i < s.size(); i++) dp[i][0] = 1;
for (int j = 1; j < t.size(); j++) dp[0][j] = 0;
for (int i = 1; i <= s.size(); i++) {
for (int j = 1; j <= t.size(); j++) {
if (s[i - 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[s.size()][t.size()];
}
};