LeetCode90.子集II

class Solution 
{
public:
    vector<int> path;
    vector<vector<int>> res;
    bool used[10] = { 0 };
    void backtrack(vector<int>& nums, int startIndex)
    {
        res.push_back(path);
        
        for (int i = startIndex; i < nums.size(); i++)
        {
            if (i > 0 && nums[i] == nums[i - 1])
            {
                if(used[i-1] == true)
                    continue;
            }
            path.push_back(nums[i]);
            used[i] = false; //上层节点用过，下层可以接着用
            backtrack(nums, i + 1);
            used[i] = true;  //本层节点用过，本层不可再用
            path.pop_back();
        }
    }
    vector<vector<int>> subsetsWithDup(vector<int>& nums) 
    {   
        sort(nums.begin(), nums.end());
        backtrack(nums, 0);
        return res;
    }
};