题目链接
法一(回溯 + 剪枝)
public class Solution40 {
private List<List<Integer>> ans;
private List<Integer> path;
public Solution40() {
this.ans = new LinkedList<>();
this.path = new LinkedList<>();
}
void backTracking(int[] candidates, int target, int sum, int start) {
if (sum == target) {
ans.add(new LinkedList<>(path));
return;
}
for (int i = start; i < candidates.length && sum + candidates[i] <= target; i++) {
if (i > start && candidates[i] == candidates[i - 1]) {
continue;
}
sum += candidates[i];
path.add(candidates[i]);
backTracking(candidates, target, sum, i + 1);
sum -= candidates[i];
path.remove(path.size() - 1);
}
}
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
Arrays.sort(candidates);
backTracking(candidates, target, 0, 0);
return ans;
}
}
本地测试
lay.showTitle(40);
int[] candidates40 = new int[]{10,1,2,7,6,1,5};
int target40 = 8;
Solution40 sol40 = new Solution40();
List<List<Integer>> ans40 = sol40.combinationSum2(candidates40, target40);
arrayOpt.showIntLists(ans40);