Subsets

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

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

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

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

思路：用backtracking写；注意recursion写下一步的时候，是i+1，而不是start+1；

注意：add (new ArrayList<Integer>(list)) 一定要重新建立一个，因为要copy出来，否则reference recursion回去的时候是null。

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        List<Integer> list = new ArrayList<Integer>();
        dfs(nums, 0, list, lists);
        return lists;
    }
    
    private void dfs(int[] nums, int index, List<Integer> list, List<List<Integer>> lists) {
        lists.add(new ArrayList<>(list));
        for(int i = index; i < nums.length; i++) {
            list.add(nums[i]);
            dfs(nums, i + 1, list, lists);
            list.remove(list.size() - 1);
        }
    }
}

思路2：每个元素，取或者不取，dfs

public class Solution {
    /**
     * @param nums: A set of numbers
     * @return: A list of lists
     */
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        if(nums == null) return lists;
        List<Integer> list = new ArrayList<Integer>();
        Arrays.sort(nums);
        dfs(nums, lists, list, 0);
        return lists;
    }
    
    private void dfs(int[] nums, List<List<Integer>> lists, List<Integer> list, int index) {
        if(index == nums.length) {
            lists.add(new ArrayList<Integer>(list));
            return;
        }
        
        // pick nums[index];
        list.add(nums[index]);
        dfs(nums, lists, list, index+1);
        
        // not pick nums[index];
        list.remove(list.size()-1);
        dfs(nums, lists, list, index+1);
    }
}