给定一个不含重复数字的整数数组 nums ,返回其 所有可能的全排列 。可以 按任意顺序 返回答案。
示例 1:
输入:nums = [1,2,3]
输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
示例 2:
输入:nums = [0,1]
输出:[[0,1],[1,0]]
示例 3:
输入:nums = [1]
输出:[[1]]
提示:
- 1 <= nums.length <= 6
- -10 <= nums[i] <= 10
- nums 中的所有整数 互不相同
回溯法:
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
this->nums = nums;
vector<vector<int>> ress;
if (nums.size() == 0) return ress;
dfs(ress, nums,0);
return ress;
}
private:
vector<int> nums;
private:
void dfs(vector<vector<int>> &ress, vector<int> &temnums,int first) {
if (first == this->nums.size()) {
ress.push_back(temnums);
return;
}
for (size_t i = first; i < this->nums.size(); i++){
swap(temnums[i], temnums[first]);
dfs(ress, temnums,first+1);
swap(temnums[i], temnums[first]);
}
}
};