[leetcode]90. Subsets II

题目链接：https://leetcode.com/problems/subsets-ii/#/description

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,2], a solution is:

[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]

class Solution{
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums)
    {
        sort(nums.begin(),nums.end());
        vector<vector<int>> res;
        vector<int> tmp;
        dp(nums,res,tmp,0);
        return res;

    }

    void dp(vector<int>& nums,vector<vector<int>>& res,vector<int> tmp,int start)
    {
        res.push_back(tmp);
        for(int i=start;i<nums.size();i++)
        {
            if(i==start || nums[i]!=nums[i-1])
            {
                tmp.push_back(nums[i]);
                dp(nums,res,tmp,i+1);
                tmp.pop_back();
            }
        }
    }
};