代码随想录算法训练营天 第九章 四十三天| 1049. 最后一块石头的重量 II 494. 目标和 474.一和零
1049. 最后一块石头的重量
在这里插入代码片class Solution {
public int lastStoneWeightII(int[] stones) {
if (stones.length == 1) {
return stones[0];
}
int sum = 0;
for (int i = 0; i < stones.length; i++) {
sum += stones[i];
}
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. 目标和
class Solution {
public int findTargetSumWays(int[] nums, int target) {
int sum = 0;
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
}
if (target < 0 && sum < -target) return 0;
if ((target+sum)%2 != 0) return 0;
int size = (target + sum) / 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.一和零
class Solution {
public int findMaxForm(String[] strs, int m, int n) {
int[][] dp = new int[m+1][n+1];
for (String str : strs) {
int zeroNum = 0;
int oneNum = 0;
for (char cr : str.toCharArray()) {
if (cr == '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];
}
}