class Solution {
public:
vector<vector<int>> ans;
vector<vector<int>> permute(vector<int>& nums) {
function<void(vector<int>,vector<int>)> dfs=[&](vector<int> get,vector<int> res){
if(get.size()==0) ans.push_back(res);
else{
for(auto c:get){
vector<int> new_get=get;
vector<int> new_res=res;
new_res.push_back(c);
new_get.erase(remove(new_get.begin(), new_get.end(), c),new_get.end());
dfs(new_get,new_res);
}
}
};
vector<int> res;
dfs(nums,res);
return ans;
}
};
46力扣:全排列
最新推荐文章于 2024-08-10 22:52:22 发布