题目描述
给定一个不含重复数字的数组 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 中的所有整数 互不相同
回溯法(时间复杂度为O(N*N!),空间复杂度为O(N))
c++实现
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>> result;
vector<int> path;
vector<bool> visited=vector<bool>(nums.size());
backtracking(nums,path,result,visited);
return result;
}
void backtracking(vector<int>nums,vector<int>&path,vector<vector<int>>&result,vector<bool>&visited)
{
if(path.size()==nums.size())
{
result.emplace_back(path);
return;
}
for(int i=0;i<nums.size();i++)
{
if(visited[i])
{ continue; }
path.push_back(nums[i]);
visited[i]=true;
backtracking(nums,path,result,visited);
path.pop_back();
visited[i]=false;
}
}
};
java实现
class Solution {
public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> result=new ArrayList<>();
HashMap<Integer,Boolean> visited=new HashMap<>();
for(int num:nums)
{
visited.put(num,false);
}
backtracking(nums,result,visited,new ArrayList<>());
return result;
}
private void backtracking(int[]nums,List<List<Integer>> result,HashMap<Integer,Boolean> visited,ArrayList<Integer>list)
{
if(list.size()==nums.length)
{
result.add(new ArrayList<>(list));
return;
}
for(int i=0;i<nums.length;i++)
{
int num=nums[i];
if(!visited.get(num))
{
list.add(num);
visited.put(num,true);
backtracking(nums,result,visited,list);
list.remove(list.size()-1);
visited.put(num,false);
}
}
}
}
python实现
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
result=[]
visited={}
for num in nums:
visited[num]=False
self.backtracking(nums,result,visited,[])
return result
def backtracking(self,nums,result,visited,ls):
if len(ls)==len(nums):
result.append(ls[:])
return
for num in nums:
if not visited[num]:
ls.append(num)
visited[num]=True
self.backtracking(nums,result,visited,ls)
ls.pop()
visited[num]=False