leetcode 78

思路：每个元素都有两种选择，选或者不选，构造增量，然后深度搜索，时间复杂度O(2^n)空间复杂度 O(n)

class Solution {
public:
vector<vector<int> > subsets(vector<int> &S) {
sort(S.begin(), S.end()); 
vector<vector<int> > result;
vector<int> path;
subsets(S, path, 0, result);
return result;

}
private:
static void subsets(const vector<int> &S, vector<int> &path, int step,
vector<vector<int> > &result) {
if (step == S.size()) {
result.push_back(path);
return;
}
// 不选S[step]
subsets(S, path, step + 1, result);
// 选S[step]
path.push_back(S[step]);
subsets(S, path, step + 1, result);
path.pop_back();
}
};