algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 07:35:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0416.分割等和子集.md

Browse Source
This commit is contained in:
jianghongcheng
2023-06-04 05:48:34 -05:00
committed by GitHub
parent 212e8f8b39
commit cb9da4fa38
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0416.分割等和子集.md
View File

@ -351,7 +351,7 @@ class Solution:
# 当前数字小于等于目标和时，可以选择使用或不使用该数字 # 当前数字小于等于目标和时，可以选择使用或不使用该数字
# dp[i][j] = dp[i - 1][j] or dp[i - 1][j - nums[i - 1]] # 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]]) dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - nums[i - 1]])
return dp[len(nums)][target_sum] return dp[len(nums)][target_sum]