Time: 0 ms (100%), Space: 17.8 MB (58.42%) - LeetHub

Author: shinecoding

0078-subsets/0078-subsets.py

@@ -0,0 +1,18 @@
+class Solution:
+    def subsets(self, nums: List[int]) -> List[List[int]]:
+        res = []
+        subset = []
+
+        def dfs(i):
+            # 완료 조건
+            if i == len(nums):
+                res.append(subset.copy())
+                return res
+            
+            subset.append(nums[i])
+            dfs(i+1)
+            subset.pop()
+            dfs(i+1)
+
+        dfs(0)
+        return res