Leetcode 90. Subsets II (Medium) (cpp)

Leetcode 90. Subsets II (Medium) (cpp)

Tag: Array, Backtracking

Difficulty: Medium

/*

90. Subsets II (Medium)

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