【LeetCode】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],
  []
]

之前先做的 Subsets II，这题目就很简单了……需要注意的是因为输出有顺序要求，还是要先sort一下。

代码：

class Solution {
public:
	vector<vector<int>> res;
	vector<vector<int> > subsets(vector<int> &S) {
		std::sort(S.begin(), S.end());
		vector<int> sets;
		sub(S, sets, 0);
		return res;
	}
	void sub(vector<int> &S, vector<int> &sets, int index){
		res.push_back(sets);
		for (int i = index; i < S.size(); i++){
			sets.push_back(S[i]);
			sub(S, sets, i + 1);
			sets.pop_back();
		}
	}
};