Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
59 lines (43 loc) · 1.67 KB

File metadata and controls

59 lines (43 loc) · 1.67 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms;
import java.util.ArrayList;
import java.util.Arrays;
public class Combination2 {
public static void main(String[] args) {
ArrayList<Character> test = new ArrayList<Character>();
test.add('c');
test.add('b');
System.out.printf("Result: %s", test.toString());
Combination2 cb = new Combination2();
int[] num = {2,2,2};
cb.combinationSum2(num, 4);
}
public ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
// first we should sort the array.
Arrays.sort(num);
ArrayList<ArrayList<Integer>> rst = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> path = new ArrayList<Integer>();
cmbHelp(num, 0, path, rst, target);
return rst;
}
public void cmbHelp(int[] num, int index, ArrayList<Integer> path, ArrayList<ArrayList<Integer>> rst, int target) {
if (target == 0) {
// add the current set into the result.
rst.add(new ArrayList<Integer>(path));
}
for (int i = index; i < num.length; i++) {
if (num[i] > target) {
// don't need to add new element;
return;
}
if (i >= 1 &&
num[i] == num[i - 1] &&
(path.size() == 0 || path.get(path.size() - 1) != num[i])) {
continue;
}
path.add(num[i]);
cmbHelp(num, i + 1, path, rst, target - num[i]);
path.remove(path.size() - 1);
}
return;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.