LeetCode-Distinct Subsequences
来源:互联网 发布:php curl exec 超时 编辑:程序博客网 时间:2024/04/30 16:45
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
.
Code:
<span style="font-size:14px;">class Solution {public: int numDistinct(string S, string T) { const int lengthS = S.size(), lengthT = T.size(); int **dp = new int *[lengthS+1]; for (int i = 0; i < lengthS+1; ++i) { dp[i] = new int[lengthT+1]; memset(dp[i], 0, sizeof(int)*(lengthT+1)); } for (int i = 0; i < lengthS+1; ++i) dp[i][0] = 1; for (int i = 1; i < lengthS+1; ++i) for (int j = 1; j < lengthT+1; ++j) dp[i][j] = dp[i-1][j]+(S[i-1]==T[j-1]?dp[i-1][j-1]:0); int result = dp[lengthS][lengthT]; for (int i = 0; i < lengthS+1; ++i) delete [] dp[i]; delete [] dp; return result; }};</span>
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
- Html - web 第一语言, 学习笔记 (二)
- linux 的socket编程
- 算法学习 - 归并排序,快速排序,冒泡排序
- linux内核之链表结构分析
- 黑马程序员:7K面试题之银行业务调度系统
- LeetCode-Distinct Subsequences
- android滑动之Scroller
- alter session set current_schema=Schema
- storm博客收藏
- windows.h与winsock2.h的包含顺序引起的问题
- 最长回文子串(中间扩展法)
- 黑马程序员_网络编程
- POJ 1611 The Suspects
- leetcode Word Break II