Subsets

Given a set of distinct integers, S, return all possible subsets.

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

For example,
If S = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

题目解析：

（1）因为要升序排列，因此先将要处理的数据进行排序。

（2）如果元素只有一个那个subsets=[[],[1]]，在这个基础上元素增加一个，subsets=[ [],[1],[2],[1,2] ]。增加的条目只是在前面已有项目的基础上，每一个增加新增的数字。

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<vector<int> > subsets(vector<int> &S) {
	sort(S.begin(),S.end());
	int len = S.size();
	vector<vector<int>> subsets;
	vector<int> temp;
	subsets.push_back(temp);

	for(int i=0;i<len;i++)
	{
		int subsets_len = subsets.size();
		for (int j=0;j<subsets_len;j++)
		{
			vector<int> temp;
			temp = subsets.at(j);
			temp.push_back(S.at(i));
			subsets.push_back(temp);
		}
	}
	return subsets;
}

void printArray(vector<vector<int> > &result)
{
	int len = result.size();
	for(int i=0;i<len;i++)
	{
		vector<int> temp = result.at(i);
		cout << "[" ;
		for(int j=0;j<(int)temp.size();j++)
		{
			cout << temp.at(j) << " ";
		}
		cout << "]" << endl;
	}
}
int main(void)
{
	vector<int> S;
	S.push_back(4);
	S.push_back(1);
	S.push_back(0);

	vector<vector<int> > result = subsets(S);

	printArray(result);
	system("pause");
	return 0;
}