리트코드 78번 Subsets (python)

Problem

LeetCode - The World's Leading Online Programming Learning Platform

Solution

DFS

from typing import List
from itertools import combinations

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        answer = []

        def dfs(idx, n_list):
            answer.append(n_list)

            for i in range(idx, len(nums)):
                dfs(i+1, n_list + [nums[i]])

        dfs(0, [])

        return answer

itertools

from typing import List
from itertools import combinations

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        answer = []
        for i in range(len(nums)+1):
            answer += list(map(list, combinations(nums, i)))
        return answer

Reference

파이썬 알고리즘 인터뷰 37번