LeetCode--90--medium--SubsetsII

package com.app.main.LeetCode;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * 90
 *
 * medium
 *
 * https://leetcode.com/problems/subsets-ii/
 *
 * Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
 *
 * Note: The solution set must not contain duplicate subsets.
 *
 * Example:
 *
 * Input: [1,2,2]
 * Output:
 * [
 *   [2],
 *   [1],
 *   [1,2,2],
 *   [2,2],
 *   [1,2],
 *   []
 * ]
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/10/19
 * Time:下午10:59
 */
public class SubsetsII {

    public List<List<Integer>> subsetsWithDup(int[] nums) {

        Arrays.sort(nums);
        List<List<Integer>> result = new ArrayList<>();

        for (int i = 0; i <= nums.length; i++) {
            backtrack(result, new ArrayList<>(), nums, 0, i);
        }


        return result;
    }


    private void backtrack(List<List<Integer>> result, List<Integer> tempList, int[] nums, int start, int depth) {
        if (depth == 0) {
            result.add(new ArrayList<>(tempList));
            return;
        }

        for (int i = start; i < nums.length; i++) {
            if (i > start && nums[i] == nums[i - 1]) {
                continue;
            }
            tempList.add(nums[i]);
            depth++;
            backtrack(result, tempList, nums, i + 1, depth);
            tempList.remove(tempList.size() - 1);
            depth--;
        }

    }
}