Day 43 代码随想录 动态规划3

---

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

   题目链接：1049. 最后一块石头的重量 II

 

class Solution(object):
    def lastStoneWeightII(self, nums):
        """
        :type stones: List[int]
        :rtype: int
        """
        target=sum(nums)//2
        sumweight=sum(nums)
        dp=[0]*(target+1)
        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 sumweight-2*dp[target]

494. 目标和

   题目链接：494. 目标和

 

class Solution(object):
    def findTargetSumWays(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        left=(target+sum(nums))%2
        if left==1 or abs(target)>sum(nums):
            return 0
        new_left=int((target+sum(nums))//2)
        dp=[0]*(new_left+1)
        dp[0]=1
        for i in range(len(nums)):
            #nums[i]是用来记录dp数组的
            for j in range(new_left,nums[i]-1,-1):
                dp[j]+=dp[j-nums[i]]
        return dp[new_left]

474. 一和零

   题目链接：

 

class Solution(object):
    def findMaxForm(self, strs, m, n):
        """
        :type strs: List[str]
        :type m: int
        :type n: int
        :rtype: 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]