class Solution {
public:
vector<vector<int>>ans;
vector<int>path;
void dfs(vector<int>& nums,vector<bool>&used){
if(path.size()==nums.size()){
ans.push_back(path);
return;
}
for(int i=0;i<nums.size();i++){
if(used[i]==true)continue;
path.push_back(nums[i]);
used[i]=true;
dfs(nums,used);
path.pop_back();
used[i]=false;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(),false);
dfs(nums,used);
return ans;
}
};
46. 全排列
最新推荐文章于 2024-09-13 16:27:15 发布