增量法subsets

#include<iostream>
#include<vector>
#include<iterator>
#include<algorithm>
using namespace std;
vector<vector<int>>subsets(vector<int>&s)
{
sort(s.begin(),s.end());
vector<vector<int>>result(1);
int i=1;
for(auto elem:s)
{
result.reserve(2*result.size());
auto half=result.begin()+result.size();
copy(result.begin(),half,back_inserter(result));
for(size_t m=0;m<1<<(elem-1);++m)
result[i++].push_back(elem);
// for_each(half,result.end(),[&elem](decltype(result[0])& e){e.push_back(elem);});
}
return result;
}
int main()
{
vector<int>s;
s.push_back(1);
s.push_back(2);
s.push_back(3);
vector<vector<int>>result=subsets(s);
for(auto i:result)
{
for(auto j:i)
{
cout<<j<<" ";
}
cout<<endl;
}
}