Subsets

Given a set of distinct integers, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[  [3],  [1],  [2],  [1,2,3],  [1,3],  [2,3],  [1,2],  []]

Show Company Tags

Show Tags

Show Similar Problems

普通的dfs题目

代码：

public List<List<Integer>> subsets(int[] nums) {        List<List<Integer>> result = new ArrayList<>();        if(nums == null || nums.length == 0) return result;        dfs(result, new ArrayList<>(), nums, 0);        return result;    }    private void dfs(List<List<Integer>> result, List<Integer> cur, int[] nums, int index){        if(index == nums.length){            result.add(new ArrayList<>(cur));            return;        }        result.add(new ArrayList<>(cur));        for(int i=index;i<nums.length;i++){            cur.add(nums[i]);            dfs(result, cur, nums, i+1);            cur.remove(cur.size()-1);        }    }