给定一个
没有重复数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
解题思路:
依次放入1,2,3,便生成一个排列,然后回溯,3,2,分别出栈,然后3 、2依次入栈,之后类似回溯。
c++ 代码
class Solution {
private:
vector<vector<int>> res;
vector<bool>used;
//p中保存了index个数字,向p中填加第index+1 个元素
void _permute(const vector<int>&nums,int index,vector<int>&p){
if(index == nums.size()){
res.push_back(p);
return;
}
for(int i = 0 ; i < nums.size() ; i ++)
if(!used[i]){
used[i] = true;
p.push_back(nums[i]);
_permute(nums, index + 1, p );
p.pop_back();
used[i] = false;
}
return;
}
public:
vector<vector<int>> permute(vector<int>& nums) {
res.clear();
if(nums.size()==0)
return res;
vector<int> p;
used=vector<bool>(nums.size(),false);
_permute(nums,0,p);
return res;
}
};
c++ 代码2
/// Time Complexity: O(n!)
/// Space Complexity: O(n)
class Solution {
private:
vector<vector<int>> res;
void generatePermutation(vector<int>& nums, int index){
if(index == nums.size()){
res.push_back(nums);
return;
}
for(int i = index ; i < nums.size() ; i ++){
swap(nums[i], nums[index]);
generatePermutation(nums, index + 1);
swap(nums[i], nums[index]);
}
return;
}
public:
vector<vector<int>> permute(vector<int>& nums) {
res.clear();
if(nums.size() == 0)
return res;
generatePermutation(nums, 0);
return res;
}
};
void printVec(const vector<int>& vec){
for(int e: vec)
cout << e << " ";
cout << endl;
}
python 代码
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
res=[]
if not nums:
return res
self.helper(nums,res,[])
return res
def helper(self,nums,res,line):
if not nums:
res.append(line)
return
for i,num in enumerate(nums):
self.helper(nums[:i]+nums[i+1:],res,line+[nums[i]])