《LeetCode力扣练习》代码随想录——回溯算法(全排列 II—Java)
刷题思路来源于 代码随想录
47. 全排列 II
-
回溯
class Solution { private List<Integer> path = new ArrayList<>(); private List<List<Integer>> result = new ArrayList<>(); private boolean[] used; public List<List<Integer>> permuteUnique(int[] nums) { used = new boolean[nums.length]; Arrays.sort(nums); backtrack(nums); return result; } private void backtrack(int[] nums) { if (path.size() == nums.length) { result.add(new ArrayList<>(path)); return; } for (int i = 0; i < nums.length; i++) { if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) { continue; } if (used[i] == false) { path.add(nums[i]); used[i] = true; backtrack(nums); path.remove(path.size() - 1); used[i] = false; } } return; } }