leetcode 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],
  []
]

分析：

递归产生，但是不一定要设计为递归调用。当前重复元素只能在前一个相同元素递归生成的元素上生成。

[ ]

[ ]  [1] 

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

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

代码：

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<vector<int>> res{{}};
        int size=res.size();
        for(int i=0;i<nums.size();++i){
            int pre_size=size;
            size=res.size();
            int r=((i>0&&nums[i]==nums[i-1])?pre_size:0);
            for(;r<size;++r){
                vector<int> temp=res[r];
                temp.push_back(nums[i]);
                res.push_back(temp);
            }
        }
        return res;
    }
    
};