-
Notifications
You must be signed in to change notification settings - Fork 0
/
039. Combination Sum.py
38 lines (33 loc) · 1.03 KB
/
039. Combination Sum.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. Combination Sum
Medium/1750/52
Given a set of candidate numbers (C) (without duplicates) and a target number (T),
find all unique combinations in C where the candidate numbers sums to T.
The same repeated number may be chosen from C unlimited number of times.
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
For example, given candidate set [2, 3, 6, 7] and target 7,
A solution set is:
[
[7],
[2, 2, 3]
]
class Solution(object):
def combinationSum(self, candidates, target):
"""
:type candidates: List[int]
:type target: int
:rtype: List[List[int]]
"""
nums = sorted(candidates)
backtrack(res, [], nums, target, 0)
return res
def backtrack(res, temp, nums, remain, start):
if remain < 0:
return
elif remain == 0:
res.append(temp)
for i in range(start, len(nums)):
temp.append(nums[i])
backtrack(res, temp, nums, remain-nums[i], i)
temp.pop()