47. Permutations II

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

For example,
[1,1,2] have the following unique permutations:

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

public class Solution {
    public List<List<Integer>> permuteUnique(int[] nums) {
        List<List<Integer>> rst = new ArrayList<List<Integer>>();
        if (nums == null || nums.length == 0) {
            return rst; 
        }
        Arrays.sort(nums);
        List<Integer> list = new ArrayList<Integer>();
        boolean[] used = new boolean[nums.length];
        helper(rst, list, nums, used);
        return rst;
    }
    public void helper(List<List<Integer>> rst, List<Integer> list, int[] nums, boolean[] used){
        if(list.size() == nums.length){
            rst.add(new ArrayList<Integer>(list));
            return;
        }
        
        for(int i = 0; i < nums.length; i++){
            if(used[i]){
                continue;
            }
            if(i>0 && nums[i - 1] == nums[i] && !used[i - 1]){ //如果前一个元素没有被用过，那么当前的也不应该用
                continue;
            }
            used[i] = true;
            list.add(nums[i]);
            helper(rst, list, nums, used);
            used[i] = false;
            list.remove(list.size() - 1);
        }
    }
}

转载于:https://my.oschina.net/u/205577/blog/1504914