LeetCode(Oct 19 '12):Distinct Subsequences
2013-07-01 14:05
441 查看
题目地址:http://leetcode.com/onlinejudge#question_115
题目要求如下:
先用了递归,小数据过了,大数据时间超限,一会再想DP的办法。
递归代码如下(可以把尾递归去掉):
小数据的测试数据如下:
题目要求如下:
先用了递归,小数据过了,大数据时间超限,一会再想DP的办法。
递归代码如下(可以把尾递归去掉):
class Solution { public: int count; int numDistinct(string S, string T) { count=0; recurD(S,T); return count; } void recurD(string S,string T) { if(T.length()==0) { count++; return; } if(S.length()==0||S.length()<T.length()) return; while(S.find(T[0])!=string::npos) { S=S.substr(S.find(T[0])+1); recurD(S,T.substr(1)); } } };
小数据的测试数据如下:
相关文章推荐
- LeetCode(Oct 29 '12):Pascal's Triangle II
- LeetCode(Oct 28 '12):Pascal's Triangle
- LeetCode Pascal's Triangle
- LeetCode之“动态规划”:Distinct Subsequences
- leetcode - Pascal's Triangle
- 'Could not apply the stored configuration for the monitor'解决方法-fedora19
- Leetcode Pascal's Triangle
- ''1234''转化为0x12,0x34
- [转贴]19 things to think about when you're having a bad day
- leetcode 12 interger to Roman && 13 Roman to Integer
- leetcode解题之 12&13. Integer to Roman Java版(罗马数字和数字的转换)
- error C2664: 'CWnd::MessageBoxW' : cannot convert parameter 1 from 'const char [12]' to 'LPCTSTR'解决方案
- leetcode 491. Increasing Subsequences & lc 78. Subsets
- Install Apache, MySQL 5.5.32 & PHP 5.5.0 on RHEL/CentOS 6.4/5.9 & Fedora 19-12
- 【LeetCode】118_Pascal's Triangle
- LeetCode (13) Pascal's Triangle (杨辉三角 )
- 打11.2.0.3.8这个psu时的报错ins_precomp.mk:19: warning: overriding commands for target `pcscfg.cfg'
- LeetCode Distinct Subsequences
- leetcode Pascal's Triangle II
- [leetcode 118] Pascal's Triangle