子集

[JesseZhao1990]

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var subsets = function(nums) {
    var res = [];
    function dfs(nums,arr,j){
        res.push([...arr]);
        for(var i=j;i<nums.length;i++){
            arr.push(nums[i]);
            dfs(nums,arr,i+1);
            arr.pop();
        }
    }
    dfs(nums,[],0);
    return res;
};

// var nums = [1,2,3]
// console.log(subsets(nums))

解题思路：

LeetCode原题地址：https://leetcode-cn.com/problems/subsets/description/