90. Subsets II

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<vector<int>>  subsetsWithDup(vector<int>& nums) {  
        m_n = nums.size();  
        vector<vector<int>>  ans;   
        int j ;   
        vector <int> temp;  
        ans.push_back(temp); //放入一个空的    
        if (m_n == 0) return ans;  //输入为空  
         vector<bool>  Visited(nums.size()+1, false); 
        ans.push_back(nums);   
        if (m_n == 1) return ans;   
         sort (nums.begin() , nums.end()) ;  
        for (int i = 1; i < m_n; ++i) //循环几个数的情况   
        {  
            j = 0 ;   
            m_k = i;  
            visit(nums , ans, temp, j,Visited);  
        }    
        return ans;  
    }  
  
    void visit(vector<int> & nums , vector<vector<int>>  &ans, vector <int> & temp, int j ,  vector<bool>& Visited )  
    {  
        if (temp.size() == m_k)  
        {  
            ans.push_back(temp);  
            return;  
        }  
        
        for (int i = j; i < m_n; ++i)  
        {  
                if (i>0 && !Visited[i-1] && nums[i] == nums[i-1])    
                continue;     
            
               if (!Visited[i])  
            {  
               Visited[i] = true;   
            temp.push_back(nums[i]);  
            visit(nums , ans, temp, i + 1 ,Visited);  
            temp.pop_back();  
                    Visited[i] = false;   
              
               }
        }  
    }  
private:  
    int m_n;  
    int m_k;  
};