From c6db9037901601bd84ed907455cbe2adf9f2e9b9 Mon Sep 17 00:00:00 2001 From: White Dove <43168562+zhouweiwei18@users.noreply.github.com> Date: Tue, 28 Jun 2022 16:24:27 +0800 Subject: [PATCH 1/2] =?UTF-8?q?Update=200494.=E7=9B=AE=E6=A0=87=E5=92=8C.m?= =?UTF-8?q?d?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 细节 --- problems/0494.目标和.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/0494.目标和.md b/problems/0494.目标和.md index 8f116fae..00e4bdfa 100644 --- a/problems/0494.目标和.md +++ b/problems/0494.目标和.md @@ -156,7 +156,7 @@ dp[j] 表示：填满j（包括j）这么大容积的包，有dp[j]种方法 有哪些来源可以推出dp[j]呢？ -不考虑nums[i]的情况下，填满容量为j - nums[i]的背包，有dp[j - nums[i]]种方法。 +不考虑nums[i]的情况下，填满容量为j的背包，有dp[j]种方法。 那么只要搞到nums[i]的话，凑成dp[j]就有dp[j - nums[i]] 种方法。 From 9343ddd30cb63ad51db6f023c581f31b1f3f9d9a Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=A8=8B=E5=BA=8F=E5=91=98Carl?= Date: Mon, 1 Aug 2022 10:50:27 +0800 Subject: [PATCH 2/2] =?UTF-8?q?Update=200494.=E7=9B=AE=E6=A0=87=E5=92=8C.m?= =?UTF-8?q?d?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0494.目标和.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/0494.目标和.md b/problems/0494.目标和.md index 00e4bdfa..cb1b9bd1 100644 --- a/problems/0494.目标和.md +++ b/problems/0494.目标和.md @@ -158,7 +158,7 @@ dp[j] 表示：填满j（包括j）这么大容积的包，有dp[j]种方法 不考虑nums[i]的情况下，填满容量为j的背包，有dp[j]种方法。 -那么只要搞到nums[i]的话，凑成dp[j]就有dp[j - nums[i]] 种方法。 +那么考虑nums[i]的话（只要搞到nums[i]），凑成dp[j]就有dp[j - nums[i]] 种方法。 例如：dp[j]，j 为5，