[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],
  []
]

自己用递归实现了一下，效率不够高，最后用dfs去实现；

class Solution {
private:
	vector<vector<int> > ret;
public:
	vector<vector<int> > subsets(vector<int> &S) {
		// Start typing your C/C++ solution below
		// DO NOT write int main() function
		sort(S.begin(),S.end());
		ret.push_back(vector<int> ());
		vector<int> cur;
		DFS(S,S.size(),0,cur);
		return ret;
	}
	void DFS(vector<int> S, int n, int start , vector<int>& cur){
		if(start==n)
			return;
		for(int i=start ; i<n ; i++){
			cur.push_back(S[i]);
			ret.push_back(cur);
			DFS(S,n,i+1,cur);
			cur.pop_back();
		}
	}
};