LeetCode 47 全排列 II

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    int used[10];

    void dfs(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] == true) continue;
            if (!used[i]) {
                path.push_back(nums[i]);
                used[i] = true;
                dfs(nums);
                path.pop_back();
                used[i] = false;
            }
        }
    }

    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        dfs(nums);

        return res;
    }
};