-
Notifications
You must be signed in to change notification settings - Fork 93
/
CombinationSum.java
67 lines (63 loc) · 2.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
<<<<<<< HEAD
// https://leetcode.com/problems/combination-sum/
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class CombinationSum {
public static void main(String[] args) {
int[] candidates = {2,3,6,7};
List<List<Integer>> sum = combinationSum(candidates, 7);
System.out.println(sum);
}
public static List<List<Integer>> combinationSum(int[] candidates, int target) {
List<List<Integer>> ans = new ArrayList<>();
findCombination(0, candidates, target, ans, new ArrayList<>());
return ans;
}
public static void findCombination(int index, int[] arr, int target, List<List<Integer>> ans, List<Integer> ds){
if(index == arr.length){
if(target == 0){
ans.add(new ArrayList<>(ds));
}
return;
}
if(arr[index] <= target){
ds.add(arr[index]);
findCombination(index, arr, target - arr[index], ans, ds);
ds.remove(ds.size()-1);
}
findCombination(index+1, arr, target, ans, ds);
}
}
=======
// https://leetcode.com/problems/combination-sum/
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class CombinationSum {
public static void main(String[] args) {
int[] candidates = {2,3,6,7};
List<List<Integer>> sum = combinationSum(candidates, 7);
System.out.println(sum);
}
public static List<List<Integer>> combinationSum(int[] candidates, int target) {
List<List<Integer>> ans = new ArrayList<>();
findCombination(0, candidates, target, ans, new ArrayList<>());
return ans;
}
public static void findCombination(int index, int[] arr, int target, List<List<Integer>> ans, List<Integer> ds){
if(index == arr.length){
if(target == 0){
ans.add(new ArrayList<>(ds));
}
return;
}
if(arr[index] <= target){
ds.add(arr[index]);
findCombination(index, arr, target - arr[index], ans, ds);
ds.remove(ds.size()-1);
}
findCombination(index+1, arr, target, ans, ds);
}
}
>>>>>>> 67aafb10a70e470ee512334062930bef20542fa0