python implementation

Azureki · May 26, 2019 · 9f3df3b · 9f3df3b
1 parent 1ac3b7e
commit 9f3df3b
Showing 1 changed file with 12 additions and 0 deletions.
diff --git a/77. Combinations/recursive.py b/77. Combinations/recursive.py
@@ -0,0 +1,12 @@
+class Solution:
+    def combine(self, n: int, k: int) -> List[List[int]]:
+        if not (0 <= k <= n):
+            return []
+        if k == 0:
+            return [[]]
+        res = self.combine(n - 1, k - 1)
+        for x in res:
+            x.append(n)
+        for x in self.combine(n - 1, k):
+            res.append(x)
+        return res