代码随想录day37：动态规划part5，01背包应用

day37：动态规划part5，01背包应用

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

class Solution {
    public int lastStoneWeightII(int[] stones) {
        int n = stones.length;
        int sum = 0;
        for (int stone : stones) sum += stone;
        int target = sum / 2;
        // dp[j]：容量j的背包放下的最大重量，容量重量都是stones[i]
        int[] dp = new int[target + 1];
        for (int i = 0; i < n; i++) {
            for (int j = target; j >= stones[i]; j--)
                dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
        }
        // 分出这么多，又粉碎抵消这么多
        return sum - 2 * dp[target];
    }
}

494.目标和

class Solution {
    public int findTargetSumWays(int[] nums, int target) {
        int sum = 0;
        for (int num : nums) sum += num;
        if (Math.abs(target) > Math.abs(sum)) return 0;
        if ((sum + target) % 2 != 0) return 0;
        int size = sum + target >> 1;
        int[] dp = new int[size + 1];
        dp[0] = 1;
        for (int i = 0; i < nums.length; i++) {
            for (int j = size; j >= nums[i]; j--)
                dp[j] += dp[j - nums[i]];
        }
        return dp[size];
    }
}

474.一和零

class Solution {
    public int findMaxForm(String[] strs, int m, int n) {
        // dp[i][j]：i个0和j个1时的最大子集长度
        int[][] dp = new int[m + 1][n + 1];
        for (String str : strs) {
            int zeroNum = 0;
            int oneNum = 0;
            for (char c : str.toCharArray()) {
                if (c == '0') zeroNum++;
                else oneNum++;
            }
            // 物品就是strs里的字符串(外层for循环)
            // 背包容量就是题目描述中的m和n(内层即下面的两层for循环)
            for (int i = m; i >= zeroNum; i--) {
                for (int j = n; j >= oneNum; j--)
                    dp[i][j] = Math.max(dp[i][j], dp[i - zeroNum][j - oneNum] + 1);
            }
        }
        return dp[m][n];
    }
}