要求:如题
思路:回溯
class Solution {
public:
unordered_map<int,int> visited;
vector<vector<int>> v;
vector<int> tmp;
void dfs(vector<int>& nums){
if(tmp.size()==nums.size()){
v.push_back(tmp);
return;
}
for(int i=0;i<nums.size();++i){
if(!visited[nums[i]]){
visited[nums[i]]=1;
tmp.push_back(nums[i]);
dfs(nums);
visited[nums[i]]=0;
tmp.pop_back();
}
}
}
vector<vector<int>> permute(vector<int>& nums) {
dfs(nums);
return v;
}
};