From e95027872ad6114e0fcef988a73487990b610e07 Mon Sep 17 00:00:00 2001 From: mhrooz Date: Wed, 19 Jun 2024 23:59:30 +0200 Subject: [PATCH] super easy dfs --- 39-240619-pass/main.py | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 39-240619-pass/main.py diff --git a/39-240619-pass/main.py b/39-240619-pass/main.py new file mode 100644 index 0000000..6c736ad --- /dev/null +++ b/39-240619-pass/main.py @@ -0,0 +1,16 @@ +class Solution: + def combinationSum(self, candidates: list[int], target: int) -> list[list[int]]: + candidates.sort() + rlt = [] + def dfs(cur, l, cur_num): + if cur == 0: + rlt.append(l) + for candidate in candidates: + if cur - candidate >= 0 and candidate >= cur_num: + dfs(cur - candidate, l + [candidate], candidate) + dfs(target, [], candidates[0]) + return rlt + + +sol = Solution() +print(sol.combinationSum([2,3,6,7], 7))