代码随想录算法训练营第三六天| 1049.最后一块石头的重量II 494.目标和 474.一和零

今日任务

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

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

题目链接： . - 力扣（LeetCode）

class Solution {
    public int lastStoneWeightII(int[] stones) {
        int sum = 0;
        for (int stone : stones) {
            sum += stone;
        }

        int target = sum / 2;
        int[] dp = new int[target + 1];

        for (int i = 0; i < stones.length; 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.目标和

题目链接： . - 力扣（LeetCode）

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

474.一和零

题目链接： . - 力扣（LeetCode） 

class Solution {
    public int findMaxForm(String[] strs, int m, int n) {
        int[][] dp = new int[m + 1][n + 1];

        for (int k = 0; k < strs.length; k++) {
            int zeroNum = 0;
            int oneNum = 0;
            for (int index = 0; index <  strs[k].length(); index++) {
                if (strs[k].charAt(index) == '0') {zeroNum++;}
                else {oneNum++;}
            }

            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];
    }
}