给定一个 没有重复 数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/permutations
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> ans = new ArrayList<>();
if(nums.length == 0) return ans;
boolean[] vis = new boolean[nums.length];
List<Integer> list = new ArrayList<>();
dfs(nums,0,list,ans,vis);
return ans;
}
private void dfs(int[] nums, int k, List<Integer> list, List<List<Integer>> ans, boolean[] vis) {
if(k == nums.length) {
ans.add(new ArrayList<>(list));
return;
}
for(int i = 0; i < nums.length; i++) {
if(!vis[i]) {
list.add(nums[i]);
vis[i] = true;
dfs(nums,k+1,list,ans,vis);
vis[i] = false;//回溯
list.remove(list.size()-1);
}
}
}
}
class Solution {
List<List<Integer>> ans = new ArrayList<>();
public List<List<Integer>> permute(int[] nums) {
f(nums,0);
return ans;
}
private void f(int[] nums, int k) {
if(k == nums.length-1) {
List<Integer> list = new ArrayList<Integer>();
for(int i = 0; i < nums.length; i++) {
list.add(nums[i]);
}
ans.add(list);
}
for(int i = k; i < nums.length; i++) {
int t = nums[k];
nums[k] = nums[i];
nums[i] = t;
f(nums,k+1);
t = nums[k];
nums[k] = nums[i];
nums[i] = t;
}
}
}