LeetCode47.全排列 II

class Solution 
{
public:
    vector<int> path;
    vector<vector<int>> res;
    bool used[8] = { 0 };
    void backtrack(vector<int>& nums)
    {

        if (path.size() == nums.size())
        {   
            res.push_back(path);
            return;
        }

        for (int i = 0; i < nums.size(); i++)
        {  
            if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false)
                continue;
            if(used[i] == true)
                continue;
            path.push_back(nums[i]);
            used[i] = true;
            backtrack(nums);
            used[i] = false;
            path.pop_back();
        }
    }
    vector<vector<int>> permuteUnique(vector<int>& nums)
    {   
        sort(nums.begin(), nums.end());
        backtrack(nums);
        return res;
    }
};