From 7df5157aab58935f0dd9784e4968bd73f1facbdf Mon Sep 17 00:00:00 2001
From: Jasen Chao <68803975+JasenChao@users.noreply.github.com>
Date: Sat, 6 Apr 2024 15:09:55 +0800
Subject: [PATCH] =?UTF-8?q?Update=200494.=E7=9B=AE=E6=A0=87=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

 Fix typos
---
 "problems/0494.\347\233\256\346\240\207\345\222\214.md" | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git "a/problems/0494.\347\233\256\346\240\207\345\222\214.md" "b/problems/0494.\347\233\256\346\240\207\345\222\214.md"
index 02edad4d8b..f030ae77e3 100644
--- "a/problems/0494.\347\233\256\346\240\207\345\222\214.md"
+++ "b/problems/0494.\347\233\256\346\240\207\345\222\214.md"
@@ -101,7 +101,7 @@ public:
         int sum = 0;
         for (int i = 0; i < nums.size(); i++) sum += nums[i];
         if (S > sum) return 0; // 此时没有方案
-        if ((S + sum) % 2) return 0; // 此时没有方案，两个int相加的时候要各位小心数值溢出的问题
+        if ((S + sum) % 2) return 0; // 此时没有方案，两个int相加的时候要格外小心数值溢出的问题
         int bagSize = (S + sum) / 2; // 转变为组合总和问题，bagsize就是要求的和
 
         // 以下为回溯法代码