代码随想录算法训练营第四十三日| LC1049. 最后一块石头的重量 II LC494. 目标和 LC474.一和零

LC1049. 最后一块石头的重量 II

class Solution:
    def lastStoneWeightII(self, stones: List[int]) -> int:
        sumWeight = sum(stones)
        target = sumWeight // 2
        dp = [0] * 15001
        #dp[j]表示容量（这里说容量更形象，其实就是重量）为j的背包，最多可以背最大重量为dp[j]
        for i in range(len(stones)):
            for j in range(target, stones[i] - 1, -1):
            #如果使用一维dp数组，物品遍历的for循环放在外层，遍历背包的for循环放在内层，且内层for循环倒序遍历
                dp[j] = max(dp[j], dp[j-stones[i]] + stones[i])
        #01背包的递推公式为：dp[j] = max(dp[j], dp[j - weight[i]] + value[i])
        return sumWeight - 2 * dp[target]
        #在计算target的时候，target = sum / 2 因为是向下取整，所以sum - dp[target] 一定是大于等于dp[target]的

LC494. 目标和

class Solution:
    def findTargetSumWays(self, nums: List[int], target: int) -> int:
        sumvalue = sum(nums)
        if abs(target) > sumvalue or (sumvalue + target) % 2 == 1: #注意该边界条件
            return 0
        bagsize = (target + sumvalue) // 2
        dp = [0] * (bagsize + 1) #填满j（包括j）这么大容积的包，有dp[j]种方法
        dp[0] = 1
        for i in range(len(nums)):
            for j in range(bagsize, nums[i] - 1, -1):
                dp[j] += dp[j - nums[i]] #只要搞到nums[i]），凑成dp[j]就有dp[j - nums[i]] 种方法
        return dp[bagsize]

LC474.一和零 

class Solution:
    def findMaxForm(self, strs: List[str], m: int, n: int) -> int:
        dp = [[0] * (n + 1) for _ in range(m + 1)]	# 默认初始化0
        # 遍历物品
        for str in strs:
            ones = str.count('1')
            zeros = str.count('0')
            # 遍历背包容量且从后向前遍历！
            for i in range(m, zeros - 1, -1):
                for j in range(n, ones - 1, -1):
                    dp[i][j] = max(dp[i][j], dp[i - zeros][j - ones] + 1)
        return dp[m][n]