From 90aa75c57300eaa7eea9a87d268cb9b0ad8a8553 Mon Sep 17 00:00:00 2001
From: bqlin <bqlins@163.com>
Date: Sat, 18 Dec 2021 18:45:54 +0800
Subject: [PATCH] =?UTF-8?q?0077.=E7=BB=84=E5=90=88=E3=80=810077.=E7=BB=84?=
 =?UTF-8?q?=E5=90=88=E4=BC=98=E5=8C=96=EF=BC=9ASwift=E5=AE=9E=E7=8E=B0?=
 =?UTF-8?q?=E5=87=8F=E5=B0=91=E5=8F=82=E6=95=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0077.组合.md       | 10 +++++-----
 problems/0077.组合优化.md | 10 +++++-----
 2 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/problems/0077.组合.md b/problems/0077.组合.md
index 2bf856df..4ec154e1 100644
--- a/problems/0077.组合.md
+++ b/problems/0077.组合.md
@@ -627,7 +627,7 @@ int** combine(int n, int k, int* returnSize, int** returnColumnSizes){
 func combine(_ n: Int, _ k: Int) -> [[Int]] {
     var path = [Int]()
     var result = [[Int]]()
-    func backtracking(_ n: Int, _ k: Int, _ startIndex: Int) {
+    func backtracking(start: Int) {
         // 结束条件，并收集结果
         if path.count == k {
             result.append(path)
@@ -638,15 +638,15 @@ func combine(_ n: Int, _ k: Int) -> [[Int]] {
         // let end = n
         // 剪枝优化
         let end = n - (k - path.count) + 1
-        guard startIndex <= end else { return }
-        for i in startIndex ... end {
+        guard start <= end else { return }
+        for i in start ... end {
             path.append(i) // 处理结点
-            backtracking(n, k, i + 1) // 递归
+            backtracking(start: i + 1) // 递归
             path.removeLast() // 回溯
         }
     }
 
-    backtracking(n, k, 1)
+    backtracking(start: 1)
     return result
 }
 ```
diff --git a/problems/0077.组合优化.md b/problems/0077.组合优化.md
index b713bdcd..5fe56e82 100644
--- a/problems/0077.组合优化.md
+++ b/problems/0077.组合优化.md
@@ -300,7 +300,7 @@ Swift：
 func combine(_ n: Int, _ k: Int) -> [[Int]] {
     var path = [Int]()
     var result = [[Int]]()
-    func backtracking(_ n: Int, _ k: Int, _ startIndex: Int) {
+    func backtracking(start: Int) {
         // 结束条件，并收集结果
         if path.count == k {
             result.append(path)
@@ -311,15 +311,15 @@ func combine(_ n: Int, _ k: Int) -> [[Int]] {
         // let end = n
         // 剪枝优化
         let end = n - (k - path.count) + 1
-        guard startIndex <= end else { return }
-        for i in startIndex ... end {
+        guard start <= end else { return }
+        for i in start ... end {
             path.append(i) // 处理结点
-            backtracking(n, k, i + 1) // 递归
+            backtracking(start: i + 1) // 递归
             path.removeLast() // 回溯
         }
     }
 
-    backtracking(n, k, 1)
+    backtracking(start: 1)
     return result
 }
 ```