From 1d44a17aaa733ef95a7eafde6f155cb5ea1a1929 Mon Sep 17 00:00:00 2001 From: ruyubai1 <104716559+ruyubai1@users.noreply.github.com> Date: Sun, 5 Mar 2023 18:52:47 +0100 Subject: [PATCH] =?UTF-8?q?python=E4=B8=80=E7=BB=B4=E6=95=B0=E7=BB=84?= =?UTF-8?q?=E5=88=9D=E5=A7=8B=E5=8C=96=E9=95=BF=E5=BA=A6=E5=BA=94=E4=B8=BA?= =?UTF-8?q?target+1?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0416.分割等和子集.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/0416.分割等和子集.md b/problems/0416.分割等和子集.md index 45dd289a..dfb327ec 100644 --- a/problems/0416.分割等和子集.md +++ b/problems/0416.分割等和子集.md @@ -302,7 +302,7 @@ class Solution: target = sum(nums) if target % 2 == 1: return False target //= 2 - dp = [0] * (len(nums) + 1) + dp = [0] * (target + 1) for i in range(len(nums)): for j in range(target, nums[i] - 1, -1): dp[j] = max(dp[j], dp[j - nums[i]] + nums[i])