algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 11:34:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1266 from Anmizi/patch-2

Browse Source 
修改 0040.组合总和II.md
This commit is contained in:
程序员Carl
2022-05-16 09:21:49 +08:00
committed by GitHub
parent 500cf6aa22 5b3607c6a1
commit 98458cdc56
1 changed files with 10 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
problems/0040.组合总和II.md
View File

@ -508,22 +508,27 @@ func backtracking(startIndex,sum,target int,candidates,trcak []int,res *[][]int)
*/ */
var combinationSum2 = function(candidates, target) { var combinationSum2 = function(candidates, target) {
const res = []; path = [], len = candidates.length; const res = []; path = [], len = candidates.length;
candidates.sort(); candidates.sort((a,b)=>a-b);
backtracking(0, 0); backtracking(0, 0);
return res; return res;
function backtracking(sum, i) { function backtracking(sum, i) {
if (sum > target) return;
if (sum === target) { if (sum === target) {
res.push(Array.from(path)); res.push(Array.from(path));
return; return;
} }
let f = -1;
for(let j = i; j < len; j++) { for(let j = i; j < len; j++) {
const n = candidates[j]; const n = candidates[j];
if(n > target - sum || n === f) continue; if(j > i && candidates[j] === candidates[j-1]){
//若当前元素和前一个元素相等
//则本次循环结束，防止出现重复组合
continue;
}
//如果当前元素值大于目标值-总和的值
//由于数组已排序，那么该元素之后的元素必定不满足条件
//直接终止当前层的递归
if(n > target - sum) break;
path.push(n); path.push(n);
sum += n; sum += n;
f = n;
backtracking(sum, j + 1); backtracking(sum, j + 1);
path.pop(); path.pop();
sum -= n; sum -= n;