class Solution {
public:
vector<vector<int>> ans;
vector<vector<int>> permute(vector<int>& nums) {
vector<int> tmp;
vector<int> visited(nums.size(),0);
dfs(tmp,nums,visited);
return ans;
}
void dfs(vector<int> tmp,vector<int>& nums,vector<int> visited){
if(tmp.size()==nums.size()){
ans.push_back(tmp);
return ;
}
for(int i=0; i<nums.size(); i++){
if(visited[i]==1) continue;
tmp.push_back(nums[i]);
visited[i] = 1;
dfs(tmp,nums,visited);
tmp.pop_back();
visited[i] = 0;
}
}
};
路径回溯,Java版的更轻松一些,C++ vector没有直接查找的函数,所以要加入visited数组判断
或者用交换,所有情况就都可以用一种方法写