Update 0416.分割等和子集.md

This commit is contained in:
jianghongcheng
2023-06-23 12:14:15 -05:00
committed by GitHub
parent 072eb2aa47
commit 35a87bd56c

View File

@ -324,6 +324,21 @@ class Solution:
return True
return False
```
卡哥版(简化版)
```python
class Solution:
def canPartition(self, nums: List[int]) -> bool:
if sum(nums) % 2 != 0:
return False
target = sum(nums) // 2
dp = [0] * (target + 1)
for num in nums:
for j in range(target, num-1, -1):
dp[j] = max(dp[j], dp[j-num] + num)
return dp[-1] == target
```
二维DP版
```python