Given a collection of distinct numbers, return all possible permutations.
For example,
[1,2,3] have the following permutations:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
使用递归的思路
class Solution {
public:
vector<vector<int>> res;
void Func(vector<int>& nums1, int idx){
if(idx == nums1.size())
res.push_back(nums1);
else {
for(int i = idx; i < nums1.size(); ++i){
swap(nums1[i], nums1[idx]);
Func(nums1, idx + 1);
swap(nums1[i], nums1[idx]);
}
}
}
vector<vector<int>> permute(vector<int>& nums) {
if(nums.size() == 0)
return res;
Func(nums, 0);
return res;
}
};