forked from hongtaocai/code_interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcombinationsum2.java
More file actions
executable file
·70 lines (53 loc) · 2.24 KB
/
combinationsum2.java
File metadata and controls
executable file
·70 lines (53 loc) · 2.24 KB
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
public class Solution {
public ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
// Start typing your Java solution below
// DO NOT write main() function
HashMap<Integer, ArrayList<ArrayList<Integer>>> numberToComb =
new HashMap<Integer, ArrayList<ArrayList<Integer>>>();
ArrayList<Integer> cda = new ArrayList<Integer>();
for(int i=0;i<num.length;i++){
cda.add(num[i]);
}
Collections.sort(cda);
for(int i=1;i<=target;i++){
numberToComb.put(i, new ArrayList<ArrayList<Integer>>());
}
for(int i=0;i<cda.size();i++){
if(cda.get(i)<=target){
ArrayList<Integer> tmp = new ArrayList<Integer>();
tmp.add(i);
numberToComb.get(cda.get(i)).add(tmp);
}
}
for(int i=1;i<=target;i++){
if(i==target){
break;
}
for(int k=0;k<cda.size();k++){
if( cda.get(k)+i<=target ){
for(ArrayList<Integer> ar : numberToComb.get(i)){
if(k<ar.get(ar.size()-1)){
continue;
}
if(Collections.binarySearch(ar,k)>=0){
continue;
}
ArrayList<Integer> arnew = new ArrayList<Integer>(ar);
arnew.add(k);
numberToComb.get(cda.get(k)+i).add(arnew);
}
}
}
}
ArrayList<ArrayList<Integer>> k = numberToComb.get(target);
HashSet<ArrayList<Integer>> res = new HashSet<ArrayList<Integer>>();
for(ArrayList<Integer> k1 : k){
ArrayList<Integer> k2 = new ArrayList<Integer>();
for(Integer m: k1){
k2.add(cda.get(m));
}
res.add(k2);
}
return new ArrayList<ArrayList<Integer>>(res);
}
}