From cb9da4fa38d861567a67ef0bd8467461e9ef90ff Mon Sep 17 00:00:00 2001 From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com> Date: Sun, 4 Jun 2023 05:48:34 -0500 Subject: [PATCH] =?UTF-8?q?Update=200416.=E5=88=86=E5=89=B2=E7=AD=89?= =?UTF-8?q?=E5=92=8C=E5=AD=90=E9=9B=86.md?= 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 7f6e3d5b..341362ba 100644 --- a/problems/0416.分割等和子集.md +++ b/problems/0416.分割等和子集.md @@ -351,7 +351,7 @@ class Solution: # 当前数字小于等于目标和时,可以选择使用或不使用该数字 # dp[i][j] = dp[i - 1][j] or dp[i - 1][j - nums[i - 1]] - # 当前数字小于等于目标和时,可以选择使用或不使用该数字的最大值 + # 当前数字小于等于目标和时,选择使用或不使用该数字的最大值 dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - nums[i - 1]]) return dp[len(nums)][target_sum]