Day 39 动态规划 part05

3道题目
1049. 最后一块石头的重量 II
494. 目标和
474. 一和零

解题理解

还是不太理解01背包的1维动规思想，今天的题先记录一下，还需要再回过头重新理解01背包。

1049

class Solution:
    def lastStoneWeightII(self, stones: List[int]) -> int:
        target = sum(stones) // 2
        dp = [0] * (target + 1)
        for stone in stones:
            for j in range(target, stone - 1, -1):
                dp[j] = max(dp[j], dp[j - stone] + stone)
        return (sum(stones) - dp[target]) - dp[target]

494

class Solution:
    def findTargetSumWays(self, nums: List[int], target: int) -> int:
        if abs(target) > sum(nums): 
            return 0
        if (target + sum(nums)) % 2 == 1:
            return 0
        bagsize = (sum(nums) + target) // 2
        dp = [0] * (bagsize + 1)
        dp[0] = 1
        for num in nums:
            for j in range(bagsize, num - 1, -1):
                dp[j] += dp[j - num]
            
        return dp[bagsize]

474

class Solution:
    def findMaxForm(self, strs: List[str], m: int, n: int) -> int:
        dp = [[0] * (n + 1) for _ in range(m + 1)]
        for s in strs:
            zeroNum = s.count('0')
            oneNum = len(s) - zeroNum
            for i in range(m, zeroNum - 1, -1):
                for j in range(n, oneNum - 1, -1):
                    dp[i][j] = max(dp[i][j], (dp[i - zeroNum][j - oneNum] + 1))
        
        return dp[m][n]