package LeetCode;

import java.util.*;

public class LC_90 {
    static List<List<Integer>> res = new ArrayList<>();
    static ArrayList<Integer> path = new ArrayList<>();

    public static void main(String[] args) {
        int[] nums = {};
        subsetsWithDup(nums);
    }

    public static List<List<Integer>> subsetsWithDup(int[] nums) {
        Arrays.sort(nums);
        backtracking(nums, 0);
        System.out.println(res);
        return res;
    }

    public static void backtracking(int[] nums, int startIdx) {
        if (startIdx > nums.length) return;
        res.add(new ArrayList<>(path));
        for (int i = startIdx; i < nums.length; i++) {
            if (i > startIdx && nums[i - 1] == nums[i]) continue;
            else path.add(nums[i]);
            backtracking(nums, i + 1);
            path.remove(path.size() - 1);
        }
    }

}