From 31eb619ea18d05e004da853d70b165ba47291c92 Mon Sep 17 00:00:00 2001
From: Anmizi <1845513904@qq.com>
Date: Fri, 29 Apr 2022 19:15:41 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BC=98=E5=8C=96JS=E7=89=88=E6=9C=AC=E4=BB=A3?=
 =?UTF-8?q?=E7=A0=81=20(0039.=E7=BB=84=E5=90=88=E6=80=BB=E5=92=8C.md)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0039.组合总和.md | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/problems/0039.组合总和.md b/problems/0039.组合总和.md
index 98b37b84..e10a827f 100644
--- a/problems/0039.组合总和.md
+++ b/problems/0039.组合总和.md
@@ -370,18 +370,17 @@ func backtracking(startIndex,sum,target int,candidates,trcak []int,res *[][]int)
 ```js
 var combinationSum = function(candidates, target) {
     const res = [], path = [];
-    candidates.sort(); // 排序
+    candidates.sort((a,b)=>a-b); // 排序
     backtracking(0, 0);
     return res;
     function backtracking(j, sum) {
-        if (sum > target) return;
         if (sum === target) {
             res.push(Array.from(path));
             return;
         }
         for(let i = j; i < candidates.length; i++ ) {
             const n = candidates[i];
-            if(n > target - sum) continue;
+            if(n > target - sum) break;
             path.push(n);
             sum += n;
             backtracking(i, sum);