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

class Solution {
public:
    vector<vector<int> > subsets(vector<int> &S) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        result.clear();
        Set = &S;
        sort(Set->begin(), Set->end());
        num = Set->size();
        for (int i = 0; i <= num; ++i) {
            int cur = 0;
            got.clear();
            trace_back(i, cur);
        }
        return result;
    }
    
    void trace_back(int k, int cur) {
        if (k == 0) {
            result.push_back(got);
            return;
        }
        
        for(int i = cur; i < num; ++i) {
            got.push_back((*Set)[i]);
            trace_back(k - 1, i + 1);
            got.pop_back();
        }
    }
    
    vector<vector<int> > result;
    vector<int> got;
    vector<int>* Set;
    int num;
};