class Solution {
public:
vector<int> path;
vector<int> used = vector<int> (21, 0);
vector<vector<int>> result;
vector<vector<int>> permute(vector<int>& nums) {
traverse(nums);
return result;
}
void traverse(vector<int>& nums){
if(path.size()==nums.size()) result.push_back(path);
for(int i=0;i<nums.size();i++){
if(used[nums[i]+10]) continue;
path.push_back(nums[i]);
used[nums[i]+10]=1;
traverse(nums);
path.pop_back();
used[nums[i]+10]=0;
}
}
};
刷题记录第九十五天-全排列
最新推荐文章于 2024-06-13 14:43:16 发布