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;
        List<Integer> res = new ArrayList<Integer>();
        Arrays.sort(nums);
        boolean[] used = new boolean[nums.length];
        backtrace(rst, res, nums, used);
        return rst;
    }
    public void backtrace(List<List<Integer>> rst, List<Integer> res, int[] nums, boolean[] used){
        if(res.size() == nums.length){
            rst.add(new ArrayList<>(res));
            return;
        }
        for(int i = 0; i < nums.length; i++){
            if(used[i]) continue;
            else if(i > 0 && nums[i] == nums[i-1] && !used[i-1]) continue;
            else{
                res.add(nums[i]);
                used[i] = true;
                backtrace(rst, res, nums, used);
                res.remove(res.size()-1);
                used[i] = false;
            }
        }
    }
}