Total Accepted: 81338
Total Submissions: 239466
Difficulty: Medium
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]
, and [3,2,1]
.
Subscribe to see which companies asked this question
先解释一下全排列的由来:
例数字组合123,它的全排列是123、213、231、321、312、132这6种。
先看213和321,它是由123中的1与后面两位数交换后的结果。
231和312分别是213和321后两位数交换后的结果。
因此,全排序就是从第1位起与后面各位交换后的产物。
code:
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>> res;
permute(res, nums, 0);
return res;
}
void permute(vector<vector<int>> &res, vector<int> &nums, int pos) {
if(pos == nums.size()) {
res.push_back(nums);
return;
}
for(int i=pos;i<nums.size();i++) {
swap(nums[pos], nums[i]);
permute(res, nums, pos + 1);
swap(nums[pos], nums[i]);
}
}
};