Subsets II.cpp

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> curr;
        sort(nums.begin(), nums.end());
        dfs(nums, 0, curr, res);
        return res;
    }
    
    
private:
    void dfs(vector<int>& nums, int start, vector<int>& curr, vector<vector<int>>& res)
    {
        res.push_back(curr);
        for(int i = start; i < nums.size(); ++i)
        {
            if(i > start && nums[i - 1] == nums[i])continue;
            curr.push_back(nums[i]);
            dfs(nums, i + 1, curr, res);
            curr.pop_back();
        }
    }
};