题目
代码
class Solution {
List<List<Integer>> res = new ArrayList<>();
public List<List<Integer>> permute(int[] nums) {
backtrack(nums,new ArrayList<>());
return res;
}
public void backtrack(int[] nums, List<Integer> temp){
if(temp.size() == nums.length){
res.add(new ArrayList<Integer>(temp));
return;
}
for(int num:nums){
if(!temp.contains(num)){
temp.add(num);
backtrack(nums,temp);
temp.remove(temp.size()-1);
}
}
}
}