代码随想录训练营第三十期|第四十三天|动态规划 part05|1049. 最后一块石头的重量 II ● 494. 目标和 ● 474.一和零

1049. 最后一块石头的重量 II - 力扣（LeetCode）

class Solution {public int lastStoneWeightII(int[] stones) {int sum = 0;for (int n : stones) {sum += n;}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 - dp[target] - dp[target];}
}

494. 目标和 - 力扣（LeetCode）

class Solution {public int findTargetSumWays(int[] nums, int target) {int sum = 0;for (int n : nums) {sum += n;}if (target < 0 && sum < -target) return 0;if ((target + sum) % 2 != 0) return 0;int size = (sum + target) / 2;if (size < 0) size = -size;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. 一和零 - 力扣（LeetCode）

class Solution {public int findMaxForm(String[] strs, int m, int n) {int[][] dp = new int[m + 1][n + 1];for(String s : strs) {int one = 0;int zero = 0;for (char c : s.toCharArray()) {if (c == '0') {zero++;} else {one++;}}for (int i = m; i >= zero; i--) {for (int j = n; j >= one; j--) {dp[i][j] = Math.max(dp[i][j], dp[i - zero][j - one] + 1);}}}return dp[m][n];}
}