力扣47.全排列II

 回溯题，构造二叉树。这里需要注意同层重复问题。

回溯三部曲

1、函数参数

vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, vector<bool>& used);

2、终止条件

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

3、单层逻辑

for (int i = 0; i < nums.size(); i++) {
    if (i > 0 && nums[i - 1] == nums[i] && used[i - 1] == false) {
        continue;
    }

    if (used[i] == false) {
        used[i] = true;
        path.push_back(nums[i]);
        backtracking(nums, used);
        path.pop_back();
        used[i] = false;
    }
}

完整代码

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums, vector<bool>& used) {
        if (path.size() == nums.size()) {
            result.push_back(path);
            return;
        }

        for (int i = 0; i < nums.size(); i++) {
            if (i > 0 && nums[i - 1] == nums[i] && used[i - 1] == false) {
                continue;
            }

            if (used[i] == false) {
                used[i] = true;
                path.push_back(nums[i]);
                backtracking(nums, used);
                path.pop_back();
                used[i] = false;
            }
        }
    }
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        result.clear();
        path.clear();
        vector<bool> used(nums.size(), false);
        sort(nums.begin(), nums.end());
        backtracking(nums, used);
        return result;
    }
};