distinct-subsequences
来源:互联网 发布:七天网络查分 编辑:程序博客网 时间:2024/06/06 08:31
题目:
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”
Return3.
程序:
class Solution {public: int numDistinct(string S, string T) { int slen = S.length(); int tlen = T.length(); vector<vector<int>> dp; vector<int> temp(tlen+1,0); temp[0] = 1; for( int i = 0; i <= slen; i++) dp.push_back( temp ); for( int i = 1; i <= slen ; i++) for(int j = 1 ; j <= tlen ; j++) { if( S[i-1] == T[j-1] ) dp[i][j] = dp[i-1][j] + dp[i-1][j-1]; else dp[i][j] = dp[i-1][j]; } return dp[slen][tlen]; }};
阅读全文
0 0
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- Distinct Subsequences
- 【奇淫巧技】echarts柱形图X轴下标移位
- Centos7 安装mysql数据库
- 数据库——范式
- android camera2 拿到的yuv420数据到底是什么样的?
- 第9章 数据库监控
- distinct-subsequences
- 回顾大一·C语言编程2.2
- rsa公钥私钥终端生成命令生成
- LeetCode 458.poor pigs
- algorithm库函数集合:
- 上传图片到jsp
- Unity3D 学习案例一
- 获取浏览器url参数
- XSS攻击原理和防止