代码随想录算法训练营DAY42｜1049. 最后一块石头的重量 II、494. 目标和、474.一和零

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

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

class Solution(object):
    def lastStoneWeightII(self, stones):
        """
        :type stones: List[int]
        :rtype: int
        """
        n = len(stones)
        sum_stones = sum(stones)

        weight = sum_stones//2 
        dp = [0 for k in range(weight+1)]

        for i in range(n):
            for j in range(weight, stones[i]-1, -1):
                dp[j] = max(dp[j], dp[j-stones[i]]+stones[i])
        
        return sum_stones-2*dp[weight]

494. 目标和

• 题目链接：494. 目标和

class Solution(object):
    def findTargetSumWays(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        sum_nums = sum(nums)
        if abs(target)>sum_nums:
            return 0
        if (target+sum_nums) %2 == 1:
            return 0
        weight = (target+sum_nums)//2

        dp = [0 for i in range(weight+1)]
        dp[0]=1
        
        for i in range(len(nums)):
            for j in range(weight, nums[i]-1, -1):
                dp[j]+=dp[j-nums[i]]
        
        return dp[weight]

474.一和零

• 题目链接：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 i in range(m+1)]
        for onestr in strs:
            one_num = onestr.count('1')
            zero_num = len(onestr)-one_num
            for i in range(m, zero_num-1, -1):
                for j in range(n, one_num-1, -1):
                    dp[i][j]=max(dp[i][j], dp[i-zero_num][j-one_num]+1)
            
        return dp[m][n]