392.判断子序列

https://programmercarl.com/0392.%E5%88%A4%E6%96%AD%E5%AD%90%E5%BA%8F%E5%88%97.html

class Solution {
public:bool isSubsequence(string s, string t) {if(s.size()==0 )return true;if(t.size()==0)return false;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;elsedp[i][j] = dp[i][j-1];}}if(dp[s.size()][t.size()]==s.size())return true;elsereturn false;}
};

115.不同的子序列

https://programmercarl.com/0115.%E4%B8%8D%E5%90%8C%E7%9A%84%E5%AD%90%E5%BA%8F%E5%88%97.html

class Solution {
public:int numDistinct(string s, string t) {vector<vector<uint64_t>> dp(s.size()+1,vector<uint64_t>(t.size()+1,0));for(int i=0;i<=s.size();i++)dp[i][0]=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]+dp[i-1][j];elsedp[i][j] = dp[i-1][j];}}return dp[s.size()][t.size()];}
};

看了解析写的，感觉自己看题还是写不出