LeetCode第78题：子集

题目详述

给定一组不含重复元素的整数数组 nums，返回该数组所有可能的子集（幂集）。

说明：解集不能包含重复的子集。

示例:

输入: nums = [1,2,3]
输出:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]

解法一：迭代

帮助理解：
newsets:
[[1]]
[[2]]
[[2], [1, 2]]
[[3]]
[[3], [1, 3]]
[[3], [1, 3], [2, 3]]
[[3], [1, 3], [2, 3], [1, 2, 3]]

outputs:
[ [] ] + [ [1] ] = [ [] , [1] ]
[ [] , [1] ] + [ [2] , [1,2] ] = [ [] , [1] , [2] , [1 , 2] ]
[ [] , [1] , [2] , [1 , 2] ] + [ [3] , [1 , 3] , [2 , 3] , [1 , 2 , 3 ] ] = 结果
[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
        List<List<Integer>> outputs = new ArrayList();
        // 首先将空数组放入
        outputs.add(new ArrayList<Integer>());
        
        for (int i = 0; i < nums.length; i++) {
            List<List<Integer>> newsets = new ArrayList();
            
            for (List<Integer> output : outputs){
                List<Integer> newset = new ArrayList();
                newset.addAll(output);
                newset.add(nums[i]);
                newsets.add(newset);
                //System.out.println(newsets.toString());  
            }
            outputs.addAll(newsets);
        }
        return outputs;
    }
}

解法二：递归

class Solution {
    List<List<Integer>> output = new ArrayList();
    private int[] nums;

    public List<List<Integer>> subsets(int[] nums) {
        this.nums = nums;
        dfs(new ArrayList<Integer>(), 0);
        return output;
    }

    private void dfs(ArrayList<Integer> curr, int index) {
        // terminator 
        if (index == nums.length) {
            output.add(new ArrayList<Integer>(curr));
            return ;
        }
        // prosess the local logic
        dfs(curr, index + 1); // not pick the number at this index
        curr.add(nums[index]);
        dfs(curr, index + 1); // pick the number at this index
        
        // reverse the current state
        curr.remove(curr.size() - 1);
    }
}