Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: [1,2,2]Output:[  [2],  [1],  [1,2,2],  [2,2],  [1,2],  []]

---

---

class Solution {public:  vector
     
      
       > subsetsWithDup(vector
       
         &S) {        vector
        
         
          > totalset = {
    {}};        sort(S.begin(),S.end());        for(int i=0; i
          

instance = totalset[k]; for(int j=0; j