LeetCode动态规划1049|494|474

最新推荐文章于 2024-07-09 23:43:07 发布

Erin Wang

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量141

点赞数 3

分类专栏： LeetCode 文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/ErinWang666/article/details/137126810

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

1049最后一块石头的重量II

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

494目标和

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

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:
            num_zero = s.count("0")
            num_one = s.count("1")
            for i in range(m, num_zero - 1, -1):
                for j in range(n, num_one - 1, -1):
                    dp[i][j] = max(dp[i][j], dp[i - num_zero][j - num_one] + 1)
        return dp[m][n]