排列是顺序相关的。
dfs直接枚举应该就可以了:
class Solution {
public:
vector<vector<int>> res;
vector<int> flags;//标志位
vector<int> tmp;
int n;
void dfs(vector<int> &nums){
if(tmp.size() == n){
res.push_back(tmp);
return;
}
for(int i = 0; i < n; ++i){
if(flags[i] == 1) continue;
flags[i] = 1;
tmp.push_back(nums[i]);
dfs(nums);
flags[i] = 0;
tmp.pop_back();
}
}
vector<vector<int>> permute(vector<int>& nums) {
n = nums.size();
flags = vector<int>(n, 0);
dfs(nums);
return res;
}
};