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. 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
2
3
4
5
6
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]
Runtime: 17 ms runtime beats 94.63% of java submissions.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
Arrays.sort(candidates);
List<List<Integer>> result = new LinkedList<List<Integer>>();
List<Integer> tmp = new ArrayList<Integer>();
dfs(0, candidates, target, tmp, result);
return result;
}
privatevoid(int begin, int[] candidates, int rest, List<Integer> tmp,
List<List<Integer>> result) {
if (rest == 0)
result.add(new ArrayList<Integer>(tmp));
/*分别从candidates[i]开始往下深搜*/
for (int i = begin; i < candidates.length && candidates[i] <= rest; i++) {
if (i > begin && candidates[i] == candidates[i - 1]) continue;
近期评论