leetcode: Distinct Subsequences
来源:互联网 发布:银行表外业务数据 编辑:程序博客网 时间:2024/06/17 12:35
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
.
一开始一直不理解题意.....
动态规划,定义dp[i][j]为字符串i变换到j的变换方法。
如果S[i]==T[j],那么dp[i][j] = dp[i-1][j-1] + dp[i-1][j]。意思是:如果当前S[i]==T[j],那么当前这个字母即可以保留也可以抛弃,所以变换方法等于保留这个字母的变换方法加上不用这个字母的变换方法。
如果S[i]!=T[i],那么dp[i][j] = dp[i-1][j],意思是如果当前字符不等,那么就只能抛弃当前这个字符。
递归公式中用到的dp[0][0] = 1,dp[i][0] = 0(把任意一个字符串变换为一个空串只有一个方法)
class Solution {public: int numDistinct(string S, string T) { if( S.size() == 0 || S.size() < T.size()) return 0; if( T.size() == 0) return 1; vector< vector< int> > dp( S.size()+1, vector< int>( T.size()+1, 0)); dp[0][0] = 1; 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]; else dp[i][j] = dp[i-1][j]; } } return dp[S.size()][T.size()]; }};
0 0
- LeetCode Distinct Subsequences
- [LeetCode]Distinct Subsequences
- [Leetcode] Distinct Subsequences *
- [leetcode] Distinct Subsequences
- [LeetCode] Distinct Subsequences
- [Leetcode] Distinct Subsequences
- leetcode 111: Distinct Subsequences
- LeetCode Distinct Subsequences
- [leetcode] Distinct Subsequences
- LeetCode - Distinct Subsequences
- Leetcode:Distinct Subsequences
- [LeetCode]Distinct Subsequences
- [LeetCode] Distinct Subsequences
- [Leetcode]Distinct Subsequences
- [leetcode]Distinct Subsequences
- Leetcode: Distinct Subsequences
- Leetcode: Distinct Subsequences
- [leetcode] Distinct Subsequences
- mvc 路由配置.html默认不进程序的,可以这样改一下
- Linux/Nginx查看搜索引擎蜘蛛爬虫的行为
- assert方法
- index.dat文件剖析
- 重要讯息给所有募捐癌症研究
- leetcode: Distinct Subsequences
- Android打电话与调用发短信界面
- Hibernate高效查询
- 【转载】char *s 和 char s[] 的区别小结
- cvRandSetRange() cvRand()
- 属性表 属性详情表 终端表三个表关联关系
- $.each 和$(selector).each()的区别
- 子弹打样互联网为您的孩子
- 子弹对于我的情人节专辑 - 重金属饲料