代码
def max_value(M,N,space,value):
dp=[[0]*(N+1) for _ in range(M+1)]
for i in range(1,M+1):
for j in range(1,N+1):
if space[i-1]<=j:
dp[i][j]=max(dp[i-1][j],dp[i-1][j-space[i-1]]+value[i-1])
else:
dp[i][j]=dp[i-1][j]
return dp[M][N]
M,N=map(int,input().split())
space=list(map(int,input().split()))
value=list(map(int,input().split()))
print(max_value(M,N,space,value))
代码
class Solution:
def canPartition(self, nums: List[int]) -> bool:
total_sum=sum(nums)
if total_sum%2!=0:
return False
target=total_sum//2
n=len(nums)
dp=[[False]*(target+1) for _ in range(n+1)]
dp[0][0]=True
for i in range(1,n+1):
for j in range(target+1):
if j < nums[i-1]:
dp[i][j]=dp[i-1][j]
else:
dp[i][j]=dp[i-1][j] or dp[i-1][j-nums[i-1]]
return dp[n][target]