###### LeetCode_115---Distinct Subsequences

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：

/**
* @author 作者 E-mail:
* @version 创建时间：2015年7月8日 下午4:11:33
* 类说明
*/
public class LeetCode115 {
public static int numDistinct(String s, String t) {
int temp[] = new int[t.length()];
for(int i = 0;i<s.length();i++){
for(int j = 0;j<t.length();j++){
if(s.charAt(i) == t.charAt(j)){
if(j==0){
temp[j]++;
break;
}else{
temp[j]+=temp[j-1];
}
}
}
}
return temp[t.length()-1];
}
public static int numDistinct1(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=0;i<S.length();i++) {
dp[i][0] = 1;
}
//递推公式
for(int i=1;i<=S.length();i++) {
for(int j=1;j<=T.length();j++) {
//如果S和T的当前字符相等，那么有两种选法；否则S的当前字符不能要
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()];
}
//308msAC
public static int numDistinct2(String S, String T) {
if(S==null||T==null) {
return 0;
}
if(S.length()<T.length()) {
return 0;
}
int [][] dp = new int[S.length()][T.length()];
int temp = 0;
for(int i=0;i<S.length();i++) {  //col
if(T.charAt(0)==S.charAt(i)){
dp[i][0]=++temp;
}else{
dp[i][0]=temp;
}
}
for(int i=1;i<S.length();i++) {
for(int j=1;j<T.length()&&j<=i;j++) {
System.out.println("i: " + i+"j: " + j);
dp[i][j] = dp[i-1][j];
if(S.charAt(i)==T.charAt(j)) {
dp[i][j] += dp[i-1][j-1];
}
}
}
return dp[S.length()-1][T.length()-1];
}
public static void main(String[] args) {
String s = "aabb";
String t = "ab";
System.out.println("numDistinct: " + numDistinct(s, t));
System.out.println("numDistinct1: " + numDistinct1(s, t));
System.out.println("numDistinct2: " + numDistinct2(s, t));
}
}

#### CF 843A Sorting by Subsequences

2018-02-20 14:09:59

#### Leetcode Distinct Subsequences 解题报告

2014-02-23 21:51:17

#### AIM Tech Round 4 (Div. 2) C. Sorting by Subsequences

2017-08-25 08:23:07

#### Distinct Subsequences 解题报告

2014-10-19 16:36:13

#### LWC 74: 792. Number of Matching Subsequences

2018-03-06 10:33:13

#### 659. Split Array into Consecutive Subsequences

2017-08-14 09:00:54

#### 792. Number of Matching Subsequences

2018-03-04 13:19:33

#### Distinct Subsequences -- LeetCode

2014-04-13 09:19:57

#### Leetcode 730. Count Different Palindromic Subsequences

2017-11-28 21:31:09

#### [leetcode] 491. Increasing Subsequences

2017-03-19 17:22:14

## 不良信息举报

LeetCode_115---Distinct Subsequences