[JS] Subsets

🔒 문제 (LeetCode 78)

Given an integer array nums of unique elements, return all possible subsets (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

Constraints:

• 1 <= nums.length <= 10
• -10 <= nums[i] <= 10
• All the numbers of nums are unique.

 

🌊 입출력

Example 1:

Input: nums = [1,2,3]
Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Example 2:

Input: nums = [0]
Output: [[],[0]]

 

---

 

🔑 해결

🌌 알고리즘 - DFS (조합)

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var subsets = function(nums) {
    const result = [];
    const len = nums.length;
    
    const dfs = (route, index) => {        
        result.push(route)
        if(route.length === len) {
            return;
        }
        
        for(let i = index; i < len; i++) {
            dfs([...route, nums[i]], i + 1);
        } 
    }
    
    dfs([], 0);
    
    return result;
};