Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
Note:
- All numbers (including target) will be positive integers.
- Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
- The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5
and target 8
,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
public class Solution {
public ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
public void dfs(ArrayList<Integer> l, int[] num, int sum, int pos){
if(sum < 0) return;
if(sum == 0){
res.add(l);
return ;
}
for(int i=pos; i<num.length; i++){
l.add(num[i]);
dfs(new ArrayList(l), num, sum - num[i], i+1);//每个至多用一次,所以i+1
l.remove(l.size() - 1);
while(i<num.length-1 && num[i] == num[i+1]) i++;//去重,不能和前三行的代码颠倒
}
}
public ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
ArrayList<Integer> l = new ArrayList<Integer>();
Arrays.sort(num);
dfs(l, num, target, 0);
return res;
}
}