回溯算法：子集2

 相关资料：代码随想录

没有什么特别的难点，只要吧组合总和2和子集做会就非常简单

class Solution {
    private List<Integer> path = new ArrayList<>();
    private List<List<Integer>> res = new ArrayList<>();
    private boolean[] used;
    public List<List<Integer>> subsetsWithDup(int[] nums) {
        if(nums.length == 0){
            res.add(path);
            return res;
        }
        Arrays.sort(nums);
        used = new boolean[nums.length];
        backTracking(nums,0);
        return res;
    }

    private void backTracking(int[] nums,int startIndex){
        res.add(new ArrayList(path));
        for(int i = startIndex;i < nums.length;i++){
            if(i > 0 && nums[i] == nums[i-1] && !used[i-1]){
                continue;
            }
            used[i] = true;
            path.add(nums[i]);
            backTracking(nums,i+1);
            path.removeLast();
            used[i] = false;
        }
    }
}