给定一个 没有重复 数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
public class Solution1 {
List<List<Integer>> res = new ArrayList<>();
public List<List<Integer>> permute(int[] nums) {
backtrace(nums, new LinkedList<>());
return res;
}
public void backtrace(int[] nums, LinkedList<Integer> chose) {
if (chose.size() == nums.length) {
res.add(new LinkedList<>(chose));
return;
}
for (int i = 0; i < nums.length; i++) {
if (chose.contains(nums[i])) {
continue;
}
chose.add(nums[i]);
backtrace(nums, chose);
chose.removeLast();
}
}
}