public class Solution {
public List<List<Integer>> permute(int[] nums) {
List<List<Integer>> list = new ArrayList<>();
if(nums == null){
return list;
}
helper(list, new ArrayList<>(), nums);
return list;
}
private void helper(List<List<Integer>> list, List<Integer> temp, int[] nums){
if(temp.size() == nums.length){
list.add(new ArrayList<>(temp));
return;
}
for(int i = 0; i < nums.length; i++){
if(temp.contains(nums[i])){
continue;
}
temp.add(nums[i]);
helper(list, temp, nums);
temp.remove(temp.size() - 1);
}
}
}
[LeetCode] 46. Permutations
最新推荐文章于 2022-11-23 22:41:13 发布