目录
LeeCode 392.判断子序列
LeeCode 115.不同的子序列
LeeCode 392.判断子序列
动规五部曲:
1.确定dp数组及下标含义: dp[i][j] 表示以下标i-1为结尾的字符串s,和以下标j-1为结尾的字符串t,相同子序列的长度;
2.确定递推公式:if (s[i - 1] == t[j - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
if (s[i - 1] != t[j - 1]) dp[i][j] = dp[i][j - 1];
3.dp数组初始化:
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1, 0));
4.确定遍历顺序:从左到右、从上到下遍历;
5.举例递推dp数组;
代码:
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 <= 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];
}
}
if (dp[s.size()][t.size()] == s.size()) return true;
return false;
}
};
时间复杂度:O(n*m) 空间复杂度:O(n*m)
LeeCode 115.不同的子序列
动规五部曲:
1.确定dp数组及下标含义: dp[i][j]:以i-1为结尾的s子序列中出现以j-1为结尾的t的个数;
2.确定递推公式: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];
3.dp数组初始化:dp[i][0] = 1; dp[0][j] = 0;
4.确定遍历顺序:从上到下、从左到右遍历;
5.举例递推dp数组;
代码:
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()];
}
};
时间复杂度:O(n*m) 空间复杂度:O(n*m)