subsets 2

class Solution {
public:
    vector<vector<int> > vec;
    void subsets(vector<int> &S,vector<int> &v, int start)
    {
        vec.push_back(v);
        for(int i=start;i<S.size();i++)
        {

            v.push_back(S[i]);
            subsets(S,v,i+1);
            v.pop_back();
            while( i+1<S.size() && S[i] == S[i+1] ) i++;
        }
        return;
    }
    vector<vector<int> > subsetsWithDup(vector<int> &S) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        sort(S.begin(),S.end());
        vec.clear();
        vector<int> v;
        subsets(S, v, 0 );
        return vec;
        
        
    }
};