题目描述
全排列(dfs + 回溯)
C++ 代码
void dfs(vector<int> nums, vector<int> temp, vector<vector<int>> & res, vector<bool> rec){
if (temp.size() == nums.size()){
res.push_back(temp);
}
for (int i = 0; i < nums.size(); i++){
if (rec[i] == false){
temp.push_back(nums[i]);
rec[i] = true;
dfs(nums, temp, res, rec);
rec[i] = false;
temp.pop_back();
}
}
}
class Solution {
public:
vector<vector<int>> permutation(vector<int>& nums) {
vector<vector<int>> res;
vector<int> temp;
vector<bool> rec(nums.size());
dfs(nums, temp, res, rec);
set<vector<int>>s(res.begin(), res.end());//去重
res.assign(s.begin(), s.end());
return res;
}
};