-
Notifications
You must be signed in to change notification settings - Fork 0
/
combinationSum.java
52 lines (43 loc) · 1.31 KB
/
combinationSum.java
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
/*
Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
The same repeated number may be chosen from candidates unlimited number of times.
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:
Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]
Example 2:
Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]
*/
class Solution{
List<List<Integer>> res = new ArrayList<>();
public List<List<Integer>> combinationSum(int [] num, int target){
if (num == null || num.length == 0) return res;
Arrays.sort(num);
helper(num, target, 0, new ArrayList<Integer>(), res);
return res;
}
public void helper(int [] num, int target, int indx, List<Integer>temp, List<List<Integer>> res){
if(target == 0) {
res.add(new ArrayList<>(temp));
return;
}
if(target < 0) return;
for(int i = indx; i < num.length; i++){
temp.add(num[i]);
helper(num, target-num[i], i, temp, res);
temp.remove(temp.size()-1);
}
}
}