40. 组合总和 II
题目描述
给定一个数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。
candidates 中的每个数字在每个组合中只能使用一次。
注意:解集不能包含重复的组合。
示例 1
输入: candidates = [10,1,2,7,6,1,5], target = 8,
输出: [ [1,1,6], [1,2,5],[1,7], [2,6] ]
示例 2
输入: candidates = [2,5,2,1,2], target = 5,
输出: [ [1,2,2], [5] ]
提示
- 1 <= candidates.length <= 100
- 1 <= candidates[i] <= 50
- 1 <= target <=30
思路
/**
* @param {number[]} candidates
* @param {number} target
* @return {number[][]}
*/
var combinationSum2 = function(candidates, target) {
let result = [];
let temp = [];
let count = 0;
candidates = candidates.sort();
let queue = [];
let flag = 0;
let backTracking = function(candidates, target, index){
if(count === target){
result.push([...temp]);
return;
}else if(count > target){
return;
}
for(let i = index; i < candidates.length; i++){
if(candidates[i] > target) continue;
if(flag === candidates[i]) continue;
temp.push(candidates[i]);
count += candidates[i];
backTracking(candidates, target, i+1);
flag = candidates[i];
count -= candidates[i];
temp.pop();
}
}
backTracking(candidates, target, 0);
return result;
};