首页 > itarticle > [leetcode] problem 47 – permutations ii

[leetcode] problem 47 – permutations ii

admin 11月 13, 2020 0

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

Example

Input: [1,1,2]

Output:

[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]

Code

public List<List<Integer>> permuteUnique(int[] nums) {
    List<List<Integer>> result = new ArrayList<>();

    Arrays.sort(nums);
    permuteUniqueHelper(result, new ArrayList<>(), new boolean[nums.length], nums);

    return result;
}

private void (List<List<Integer>> result, List<Integer> permute, boolean[] visit, int[] nums) {
    if (permute.size() == nums.length) {
        result.add(new ArrayList<>(permute));
        return;
    }

    for (int i = 0; i < nums.length; i++) {
        if (visit[i] || (i > 0 && nums[i] == nums[i - 1] && !visit[i - 1]))
            continue;

        permute.add(nums[i]);
        visit[i] = true;
        permuteUniqueHelper(result, permute, visit, nums);
        permute.remove(permute.size() - 1);
        visit[i] = false;
    }
}