一点一点填
unordered_map<int,bool>used;
vector<vector<int>>res;
vector<int>path;
void dfs(vector<int>&nums)
{
int n=nums.size();
if(path.size()==n)
{
res.push_back(path);
return;
}
for(int i=0;i<n;i++)
{
if(used[nums[i]])continue;
used[nums[i]]=true;
path.push_back(nums[i]);
dfs(nums);
used[nums[i]]=false;
path.pop_back();
}
}