题目:
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
.
题目来源:https://oj.leetcode.com/problems/distinct-subsequences/
解题思路:递归,先把S中的所有字母存入向量中,然后对应T中的字母,T中后面的字符必须在前面的字符后面出现,看有几种形式;另一种递归是直接计数字符,这个比较常规,而且空间和时间复杂度都比上个递归低,详细代码参见:http://blog.csdn.net/jellyyin/article/details/9060709。动归:根据上面已经求出的一行来计算下面一行以S=“rabbbiat”,T=“rabbit”为例,如下所示:
递归版:超时
#include<iostream>
#include<vector>
using namespace std;
//n表示当前访问的是T的第n个字符,k表示num[n-1]中用到的是k
void numDistinct(string T,int n,int k,map<char,vector<int> > num,int &result)
{
if(n==T.size())
{
result++;
return ;
}
for(int i=0;i<num[T[n]].size();i++)
{
if(num[T[n]][i]>k)
numDistinct(T,n+1,num[T[n]][i],num,result);
}
}
int numDistinct(string S, string T)
{
if(T.size()>S.size()|| T.empty())
return 0;
map<char,vector<int> > num;
int result=0;
for(int i=0;i<S.size();i++)
num[S[i]].push_back(i);
numDistinct(T,0,-1,num,result);
return result;
}
int main()
{
string S = "aabdbaabeeadcbbdedacbbeecbabebaeeecaeabaedadcbdbcdaabebdadbbaeabdadeaabbabbecebbebcaddaacccebeaeedababedeacdeaaaeeaecbe",T = "bddabdcae";
cout<<numDistinct(S,T)<<endl;
system("pause");
return 0;
}
动归版:二维数组
#include<iostream>
#include<vector>
using namespace std;
int numDistinct(string S, string T)
{
if(T.size()>S.size()|| T.empty())
return 0;
//已经初始化所有值为0了
vector<vector<int> >result(T.size()+1,vector<int>(S.size()+1,0));
for(int i=1;i<=S.size();i++)//第一行
{
if(T[0]==S[i-1])
result[1][i]=result[1][i-1]+1;
else
result[1][i]=result[1][i-1];
}
for(int i=2;i<=T.size();i++)
{
for(int j=1;j<=S.size();j++)
{
if(T[i-1]==S[j-1])
result[i][j]=result[i-1][j-1]+result[i][j-1];
else
result[i][j]=result[i][j-1];
}
}
return result[T.size()][S.size()];
}
int main()
{
string S = "rabbbit", T = "rabbit";
cout<<numDistinct(S,T)<<endl;
system("pause");
return 0;
}
动归版:滚动数组:
#include<iostream>
#include<vector>
using namespace std;
int numDistinct(string S, string T)
{
if(T.size()>S.size()|| T.empty())
return 0;
//已经初始化所有值为0了
vector<vector<int> >result(2,vector<int>(S.size()+1,0));
for(int i=0;i<S.size();i++)
if(T[0]==S[i])
result[0][i+1]=result[0][i]+1;
else
result[0][i+1]=result[0][i];
for(int i=1;i<T.size();i++)
{
for(int j=0;j<S.size();j++)
{
if(T[i]==S[j])
result[i&1][j+1]=result[i&1][j]+result[(i-1)&1][j];
else
result[i&1][j+1]=result[i&1][j];
}
}
return result[(T.size()-1)&1][S.size()];
}
int main()
{
string S = "rabbbit", T = "rabbit";
cout<<numDistinct(S,T)<<endl;
system("pause");
return 0;
}
动归版:滚动数组
#include<iostream>
#include<vector>
using namespace std;
int numDistinct(string S, string T)
{
if(T.size()>S.size()|| T.empty())
return 0;
//已经初始化所有值为0了
vector<vector<int> >result(2,vector<int>(S.size()+1,0));
for(int i=0;i<S.size();i++)
if(T[0]==S[i])
result[0][i+1]=result[0][i]+1;
else
result[0][i+1]=result[0][i];
for(int i=1;i<T.size();i++)
{
for(int j=0;j<S.size();j++)
{
if(T[i]==S[j])
result[i&1][j+1]=result[i&1][j]+result[(i-1)&1][j];
else
result[i&1][j+1]=result[i&1][j];
}
}
return result[(T.size()-1)&1][S.size()];
}
int main()
{
string S = "rabbbit", T = "rabbit";
cout<<numDistinct(S,T)<<endl;
system("pause");
return 0;
}