[leetcode]Subsets II

Given a collection of integers that might contain duplicates, 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,2], a solution is:

[
[2],
[1],
[1,2,2],
[2,2],
[1,2],
[]
]

看了别人的结题报告的。转自这里

void findsubset(vector<int> s, int index, vector<int> &subset, vector<vector<int>> &res)
    {
        res.push_back(subset);
        for(int i = index; i< s.size(); i++)
        {
            if(i!=index && s[i]==s[i-1])continue;
            subset.push_back(s[i]);
            findsubset(s,i+1,subset,res);
            subset.pop_back();
        }
    }
    vector<vector<int> > subsetsWithDup(vector<int> &S) {
        // Note: The Solution object is instantiated only once.
        vector<vector<int>> res;
        sort(S.begin(),S.end());
        vector<int> subset;
        findsubset(S,0,subset,res);
        return res;
    }