Leetcode-90. Subsets II

题目

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],
[]
]
求子集，但原数组中可能有重复的元素，子集中不能出现重复

思路

在 Leetcode-78. Subsets的基础上添加一句判断即可
if(i>step && nums[i] == nums[i-1])
continue;

代码

class Solution {
public:
    vector<vector<int> > res;
    vector<int> ans;
    vector<vector<int> > subsetsWithDup(vector<int>& nums) {
        if(nums.size() == 0)
            return res;
        sort(nums.begin(), nums.end());
        dfs(0, ans, nums);
//        for(int i=0; i<res.size(); i++) {
//            for(int j=0; j<res[i].size(); j++)
//                cout << res[i][j] << " ";
//            cout << endl;
//        }
        return res;
    }

    void dfs(int step, vector<int>& ans, vector<int>& nums) {
        res.push_back(ans);
        for(int i=step; i<nums.size(); i++) {
            if(i>step && nums[i] == nums[i-1])
                continue;
            ans.push_back(nums[i]);
            dfs(i+1, ans, nums);
            ans.pop_back();
        }
    }
};