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

Merge pull request #1264 from Anmizi/patch-1

Browse Source 
优化JS版本代码 (0039.组合总和.md)
This commit is contained in:
程序员Carl
2022-05-16 09:21:20 +08:00
committed by GitHub
parent bcd43f26bb 31eb619ea1
commit 500cf6aa22
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0039.组合总和.md
View File

@ -370,18 +370,17 @@ func backtracking(startIndex,sum,target int,candidates,trcak []int,res *[][]int)
```js ```js
var combinationSum = function(candidates, target) { var combinationSum = function(candidates, target) {
const res = [], path = []; const res = [], path = [];
candidates.sort(); // 排序 candidates.sort((a,b)=>a-b); // 排序
backtracking(0, 0); backtracking(0, 0);
return res; return res;
function backtracking(j, sum) { function backtracking(j, sum) {
if (sum > target) return;
if (sum === target) { if (sum === target) {
res.push(Array.from(path)); res.push(Array.from(path));
return; return;
} }
for(let i = j; i < candidates.length; i++ ) { for(let i = j; i < candidates.length; i++ ) {
const n = candidates[i]; const n = candidates[i];
if(n > target - sum) continue; if(n > target - sum) break;
path.push(n); path.push(n);
sum += n; sum += n;
backtracking(i, sum); backtracking(i, sum);