没有重复项数字的全排列_牛客题霸_牛客网 (nowcoder.com)
class Solution {
public:
vector<vector<int> >res;
vector<int> path;
void backtracking(vector<int> &num, vector<bool> &used){
if(path.size() == num.size()){
res.push_back(path);
return ;
}
for(int i = 0; i < num.size(); ++i){
if(used[i] == true) continue;
used[i] = true;
path.push_back(num[i]);
backtracking(num,used);
path.pop_back();
used[i] = false;
}
}
vector<vector<int> > permute(vector<int> &num){
res.clear();
path.clear();
vector<bool> used(num.size(),false);
backtracking(num,used);
return res;
}
};