115. Distinct Subsequences
来源:互联网 发布:2017金融大数据论坛 编辑:程序博客网 时间:2024/05/29 17:05
Given a string S and a string T, count the number of distinct subsequences of S which equals T.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] 表示数列s[i],t[j]的最大数目。则这时dp[i][j] = dp[i-1][j] + dp[i-1][j-1] (s[i] =t[j]);如果删除是s[i],则这时dp[i][j] = dp[i-1][j],如果保留s[i],则需要满足s[i] = t[j];
class Solution {public: int numDistinct(string s, string t) { int n = s.size(); int m = t.size(); if(n < m){ return 0; } vector<int> cnt(m+1,0); vector<vector<int>> dp(n+1,cnt); for(int i = 0;i <= n; ++i){ dp[i][0] = 1; } for(int i = 1;i <= n ; ++i){ for(int j = 1;j <= i&& j <= m; ++j){ dp[i][j] = dp[i-1][j] + (s[i-1] == t[j-1]?dp[i-1][j-1]:0); } } return dp[n][m]; }};
阅读全文
0 0
- LeetCode 115. Distinct Subsequences
- [Leetcode] 115. Distinct Subsequences
- 115.Distinct Subsequences
- [leetcode] 115.Distinct Subsequences
- [leetcode] 115.Distinct Subsequences
- 115. Distinct Subsequences
- Leetcode 115. Distinct Subsequences
- 【LeetCode】115. Distinct Subsequences
- 115. Distinct Subsequences
- LeetCode 115. Distinct Subsequences
- [leetcode]115. Distinct Subsequences
- LeetCode-115.Distinct Subsequences
- 115. Distinct Subsequences
- [LeetCode] 115. Distinct Subsequences
- 115. Distinct Subsequences
- 115. Distinct Subsequences
- 115. Distinct Subsequences
- 115. Distinct Subsequences
- img.convertTo(img, CV_32FC3)
- JS中的数组及相关操作
- shell conculate
- 正则表达
- 选择排序
- 115. Distinct Subsequences
- lua之字符串模式匹配
- BeautifulSoup 爬虫
- POI导入导出excel
- linux下cp命令---C代码实现
- vue-touch
- 抓包工具Fiddler:手机设置代理(IOS)
- 关于iOS企业开发者账号要注意的地方,谨防被骗
- linux环境下gitblit搭建