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

 

Code:

class Solution {public:    void findSub(vector
     
       &S,int level,vector
      
        &buf,vector
       
        
         > &res){        for(int i=level;i
         

> subsetsWithDup(vector

&S) { vector

> res; vector

buf; res.push_back(buf); sort(S.begin(),S.end()); findSub(S,0,buf,res); return res; }};