8. Subsets

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain d

class Solution {
     public List<List<Integer>> subsets(int[] nums) {
        int length = nums.length;
        List<List<Integer>> temp = new ArrayList<>();
        for (int i = 1; i <= length; i++) {
            List<List<Integer>> subsets = subsets(nums, 0, i, new ArrayList<Integer>());
            temp.addAll(subsets);
        }
        temp.add(new ArrayList<Integer>());
        return temp;
    }

    private List<List<Integer>> subsets(int[] nums, int start, int count, List<Integer> integers1) {
        if (integers1.size() == count) {
            ArrayList<List<Integer>> lists = new ArrayList<>();
            lists.add(new ArrayList<Integer>(integers1));
            return lists;
        }
        ArrayList<List<Integer>> lists = new ArrayList<>();
        int length = nums.length;
        for (int i = start; i < length; i++) {
            integers1.add(nums[i]);
            List<List<Integer>> subsets = subsets(nums, i + 1, count, integers1);
            lists.addAll(subsets);
            integers1.remove(integers1.size()-1);

        }
        return lists;
    }

}

uplicate subsets.