leetcode-----90. 子集 II

• 链接：https://leetcode-cn.com/problems/subsets-ii/

代码

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> path;

    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        dfs(nums, 0);
        return ans;
    }

    void dfs(vector<int>& nums, int u) {
        if (u == nums.size()) {
            ans.push_back(path);
            return;
        }
        int k = u + 1;
        while (k < nums.size() && nums[k] == nums[u]) k++;
        for (int i = 0; i <= k - u; ++i) {
            dfs(nums, k);
            path.push_back(nums[u]);
        }

        for (int i = 0; i <= k - u; ++i) path.pop_back(); 
    }
};