Subsets

-----QUESTION-----

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

-----SOLUTION-----

class Solution {
public:
    vector<vector<int>> subsets(vector<int> &S) {
        vector<vector<int>> result;
        vector<int> pre;
        result.push_back(pre);
        if(S.size()==0)
            return result;
        sort(S.begin(),S.end());
        DepthFirst(S,result,pre,0);
        return result;
    }
    void DepthFirst(vector<int> &S , vector<vector<int>> &result ,vector<int> &pre , int depth)
    {
        if (depth==S.size()) {
            return;
        }
        pre.push_back(S[depth]);
        result.push_back(pre);
        DepthFirst(S,result,pre,depth+1);
        pre.pop_back();
        DepthFirst(S,result,pre,depth+1);
    }
 
};