首页 > 代码库 > Distinct Subsequences
Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ACE" is a subsequence of "ABCDE" while "AEC" is not).
Here is an example:
S = "rabbbit", T = "rabbit"
Return 3.
class Solution {public: int numDistinct(string s, string t) { int l1 = s.length(); int l2 = t.length(); int dp[l1+1][l2+1]; for(int i=0;i<l1+1;i++){ for(int j=0;j<l2+1;j++){ if(i==0 && j==0){ dp[i][j] = 1; }else if (i==0){ dp[i][j] = 0; }else if(j==0){ dp[i][j] = 1; }else { 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[l1][l2]; }};
Distinct Subsequences
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。