LeetCode Distinct Subsequences
来源:互联网 发布:我的世界java连接错误 编辑:程序博客网 时间:2024/05/14 07:22
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的一道题,dp[i][j]表示S的前i个和T的前j个的匹配情况,首先dp[i][j]=dp[i-1][j],然后再讨论S[i-1]和T[j-1]的情况。
public class Solution { public int numDistinct(String S, String T) { if (S == null || T == null) return 0;if (S.length() < T.length()) return 0;int dp[][] = new int[S.length()+1][T.length()+1];dp[0][0] = 1;for (int i = 1; i <= S.length(); i++)dp[i][0] = 1;for (int i = 1; i <= S.length(); i++)for (int j = 1; j <= T.length(); j++) {dp[i][j] = dp[i-1][j]; if (S.charAt(i-1) == T.charAt(j-1))dp[i][j] += dp[i-1][j-1];}return dp[S.length()][T.length()]; }}
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
- Eclipse下clean作用
- C/C++中的结构体对齐问题(内存对齐)
- (好文)APK 扩展文件及使用
- java.lang.Exception: DEBUG STACK TRACE for PoolBackedDataSource.close().
- Android LayoutInflater详解
- LeetCode Distinct Subsequences
- RMAN传输表空间
- 怎么把不同的PDF文件转成PPT格式
- Android 自定义 ViewPager 打造千变万化的图片切换效果
- 旅游风景展示应用源码iPad版
- sockaddr和sockaddr_in的区别
- CSS3选择器
- 程序集版本中使用SVN版本号自动生成方法详解
- JS判断手机浏览器