代码随想录训练营第III期--042--python

# 代码随想录训练营第III期--042--python

# 0-1背包 example
# 主要还是对j的理解还有就是dp的初始化
class Solution:
    def test2bags(self, size, weight, value):
        r, c = len(weight), size + 1 
        dp = [[0 for _ in range(c)] for _ in range(r)]

        for i in range(r):
            dp[i][0] = 0 
        first_weight, first_value = weight[0], value[0]
        for j in range(1, c):
            if first_weight <= j:
                dp[0][j] = first_weight

        for i in range(1, len(weight)):
            cur_weight, cur_val = weight[i], value[i]
            for j in range(1, c):
                if cur_weight > j:
                    dp[i][j] = dp[i-1][j]
                else:
                    dp[i][j] = max(dp[i-1][j], dp[i-1][j-cur_weight] + cur_val)

        print(dp)


# 416. 分割等和子集
# 不会
    def canPartition(self, nums):
        target = sum(nums)
        if target % 2 == 1: return False 
        target //= 2 
        dp = [0] * 10001 
        for i in range(len(nums)):
            for j in range(target, nums[i]  - 1, -1):
                dp[j] = max(dp[j], dp[j - nums[i]] + nums[i])
        return target == dp[target]