题目描述;
给定一个没有重复数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
算法1:DFS
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>>ans;
if(nums.size()==0)
return ans;
vector<int>out;
vector<int>visit(nums.size(), 0);
dfs(ans, nums, 0, out, visit);
return ans;
}
void dfs(vector<vector<int> >&ans, vector<int>nums, int level, vector<int>& out, vector<int>& visit)
{
if(level == nums.size())
{
ans.push_back(out);
return ;
}
for(int i=0; i<nums.size(); i++)
{
if(!visit[i])
{
visit[i] = 1;
out.push_back(nums[i]);
dfs(ans, nums, level+1, out, visit);
out.pop_back();
visit[i] = 0;
}
}
}
};
算法2:STL库函数:next_permutation()
next_permutation() 的使用:C++中全排列函数next_permutation 用法
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>>ans;
sort(nums.begin(), nums.end()); //先排列成最小的序列
ans.push_back(nums);
while(next_permutation(nums.begin(), nums.end())) //存在最小的序列,就返回true
{
ans.push_back(nums);
}
return ans;
}
};
其他解法:
参考:题解