onlybooks#30

likejazz · web-flow · commit 92e1a97226ee · 2020-09-14T19:15:34.000+09:00
diff --git a/4-non-linear-data-structures/ch12/35-1.py b/4-non-linear-data-structures/ch12/35-1.py
@@ -8,6 +8,7 @@ def combine(self, n: int, k: int) -> List[List[int]]:
         def dfs(elements, start: int, k: int):
             if k == 0:
                 results.append(elements[:])
+                return
 
             # 자신 이전의 모든 값을 고정하여 재귀 호출
             for i in range(start, n + 1):
