From a28c40a8bcbb068c9d2f9f4b902322ce04e888ef Mon Sep 17 00:00:00 2001
From: Alvinn <138186772+fubugun@users.noreply.github.com>
Date: Mon, 9 Dec 2024 17:06:28 +0800
Subject: [PATCH] =?UTF-8?q?Update=2020201107=E5=9B=9E=E6=BA=AF=E5=91=A8?=
 =?UTF-8?q?=E6=9C=AB=E6=80=BB=E7=BB=93.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/周总结/20201107回溯周末总结.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/周总结/20201107回溯周末总结.md b/problems/周总结/20201107回溯周末总结.md
index 2d20a197..7e333c76 100644
--- a/problems/周总结/20201107回溯周末总结.md
+++ b/problems/周总结/20201107回溯周末总结.md
@@ -75,7 +75,7 @@ for (int i = startIndex; i < candidates.size() && sum + candidates[i] <= target;
 
 除了这些难点，**本题还有细节，例如：切割过的地方不能重复切割所以递归函数需要传入i + 1**。
 
-所以本题应该是一个道hard题目了。
+所以本题应该是一道hard题目了。
 
 **本题的树形结构中，和代码的逻辑有一个小出入，已经判断不是回文的子串就不会进入递归了，纠正如下：**