/*
 * @lc app=leetcode.cn id=90 lang=cpp
 *
 * [90] 子集 II
 */

// @lc code=start
class Solution {
    vector<int> track;
    vector<vector<int>> res;

    void backtrack(vector<int>& nums, int start) {
        res.emplace_back(track);

        for (int i = start; i < nums.size(); ++i) {
            if(i > start && nums[i] == nums[i - 1]) continue;
            track.emplace_back(nums[i]);
            backtrack(nums, i + 1);
            track.pop_back();
        }
    }
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        backtrack(nums, 0);
        return res;
    }
};
// @lc code=end