全排列问题

class Solution {
public:
    vector<int> nums;
    vector<int> tmp;
    bool used[10];
    vector<vector<int>> results;
    void dfs(int x){
        if(tmp.size() >= nums.size()){
            results.push_back(tmp);
            return;
        }

        int pre = 0x3f;
        for(int i = 0; i < nums.size(); i ++){
            if(nums[i] != pre){
                if(!used[i]){
                    tmp.push_back(nums[i]);
                    used[i] = 1;
                    dfs(i);
                    tmp.pop_back();
                    used[i] = 0;
                    pre = nums[i];
                }
                
            }
        }
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        this->nums = nums;
        dfs(0);
        return results;
    }
};

实际上很简单，比之前的都要简单