求出全部的子集,有很多用处,例如下面这个题,在时间复杂度要求不高的情况下,可以用全排列来求。怎样将数字的全部子集算法,用到具体的题目中去:
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.
Return all such possible sentences.
For example, given
s ="catsanddog",
dict =["cat", "cats", "and", "sand", "dog"].
A solution is["cats and dog", "cat sand dog"].
vector<string> wordBreak(string s, unordered_set<string> &dict)
{
vector<string>T;
for (auto i = dict.begin(); i != dict.end(); ++i)
{
T.push_back(*i);
}
vector<string>D;
int n=T.size();
vector<int>A(n);
find(n,A,0,s,D,T);
return D;
}
//全部子集的生成算法,其中A[]保存时0-n的全部子集
void find(int n,vector<int>&A,int cur,string s,vector<string>&D,vector<string>T)
{
string t;
for(int i=0;i<cur;i++)
{
t+=T[A[i]];
}
if(t==s)
{
string x;
for(int i=0;i<cur-1;i++)
x+=T[A[i]]+" ";
x+=T[A[cur-1]];
D.push_back(x);
}
int s1=cur?A[cur-1]+1:0;
for(int i=s1;i<n;i++)
{
A[cur]=i;
find(n,A,cur+1,s,D,T);
}
}