yys130826的博客

class Solution: def canPartition(self, nums: List[int]) -> bool: if sum(nums)%2==1: return False bag=sum(nums)//2#背包的体积 dp=[0]*(bag+1)#能凑成i的最大的子集和。 for i in range(len(nums)): for j in range...