-
Notifications
You must be signed in to change notification settings - Fork 0
/
39. 组合总和.py
70 lines (52 loc) · 1.67 KB
/
39. 组合总和.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
"""
39. 组合总和
给定一个无重复元素的正整数数组 candidates 和一个正整数 target ,找出 candidates 中所有可以使数字和为目标数 target 的唯一组合。
candidates 中的数字可以无限制重复被选取。如果至少一个所选数字数量不同,则两种组合是唯一的。
对于给定的输入,保证和为 target 的唯一组合数少于 150 个。
示例 1:
输入: candidates = [2,3,6,7], target = 7
输出: [[7],[2,2,3]]
示例 2:
输入: candidates = [2,3,5], target = 8
输出: [[2,2,2,2],[2,3,3],[3,5]]
示例 3:
输入: candidates = [2], target = 1
输出: []
示例 4:
输入: candidates = [1], target = 1
输出: [[1]]
示例 5:
输入: candidates = [1], target = 2
输出: [[1,1]]
提示:
1 <= candidates.length <= 30
1 <= candidates[i] <= 200
candidate 中的每个元素都是独一无二的。
1 <= target <= 500
"""
"""
思路:枚举法,遍历所有的要素
"""
# import py_testing
class Solution:
def combinationSum(self, candidates:list, target: int) ->list:
res = []
candidates.sort()
n=len(candidates)
def helper(tmp_target,tmp,i):
# print("ooo",tmp_target, tmp, i)
if (i<n and tmp_target < 0)or i == n:
return
if tmp_target == 0:
res.append(tmp)
# print("333",res)
return
helper(tmp_target-candidates[i], tmp+[candidates[i]], i)
print(tmp_target, tmp, i)
helper(tmp_target, tmp , i+1)
helper(target, [], 0)
return res
candidates = [2, 3, 6, 7]
target = 7
ans = Solution().combinationSum(candidates, target)
print(ans)