LeetCode 47. Permutations II

Description

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

Example

Code

• java

class Solution {

    public List<Integer> getNextPermutation(List<Integer> list) {
        int i = list.size() - 1;
        for(; i > 0; i--) {
            if(list.get(i) > list.get(i - 1)) break;
        }
        if(i == 0) return null;
        List<Integer> result = new ArrayList<>(list.subList(0, i - 1));
            int index = i;
            for(int j = i + 1; j < list.size(); j++) {
                if(list.get(j) > list.get(i - 1)) {
                    index = j;
                }
            }
            Collections.swap(list, i-1, index);
            result.add(list.get(i - 1));
            List<Integer> tempList = new ArrayList<>();
            for(int j = i; j < list.size(); j++) {
                tempList.add(list.get(j));
            }
            Collections.sort(tempList);
            result.addAll(tempList);
        return result;
    }
    
    public List<List<Integer>> permuteUnique(int[] nums) {
        Arrays.sort(nums);
        List<List<Integer>> result = new ArrayList<>();
        List<Integer> temp = Arrays.stream(nums).boxed().collect(Collectors.toList());
        do {
            result.add(new ArrayList<>(temp));
            temp = getNextPermutation(temp);
        } while(temp != null);
        
        return result;
    }
}

• Others’ Solution

when a number has the same value with its previous, we can use this number only if his previous is used

public class Solution {
    public List<List<Integer>> permuteUnique(int[] nums) {
        List<List<Integer>> res = new ArrayList<List<Integer>>();
        if(nums==null || nums.length==0) return res;
        boolean[] used = new boolean[nums.length];
        List<Integer> list = new ArrayList<Integer>();
        Arrays.sort(nums);
        dfs(nums, used, list, res);
        return res;
    }

    public void dfs(int[] nums, boolean[] used, List<Integer> list, List<List<Integer>> res){
        if(list.size()==nums.length){
            res.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]);
            dfs(nums,used,list,res);
            used[i]=false;
            list.remove(list.size()-1);
        }
    }
}

Conclusion

• 自己想了一个比较笨的方法
• 爆搜天下第一