Merge pull request #10 from iamAntimPal/Leetcode-75

Leetcode 75

Author: iamAntimPal

Solution/216. Combination Sum III/216. Combination Sum III.py

@@ -0,0 +1,18 @@
+class Solution:
+    def combinationSum3(self, k: int, n: int) -> List[List[int]]:
+        def dfs(i: int, s: int):
+            if s == 0:
+                if len(t) == k:
+                    ans.append(t[:])
+                return
+            if i > 9 or i > s or len(t) >= k:
+                return
+            t.append(i)
+            dfs(i + 1, s - i)
+            t.pop()
+            dfs(i + 1, s)
+
+        ans = []
+        t = []
+        dfs(1, n)
+        return ans