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) 
    {
        int n=nums.size();
        if(n==0)
            return {};
        vector<vector<int>> ret;
        vector<int> out;
        sort(nums.begin(),nums.end());
        findAll(nums,0,out,ret);
        return ret;
    }
    void findAll(vector<int>& nums,int start,vector<int>& out,vector<vector<int>>& ret)
    {
        ret.push_back(out);
        for(int i=start;i<nums.size();i++)
        {
            out.push_back(nums[i]);
            findAll(nums,i+1,out,ret);
            out.pop_back();
            while(i<nums.size()-1&&nums[i]==nums[i+1])
                i++;
        }
    }
};