Leetcode 1049. 最后一块石头的重量 II
题目链接
思路:01背包问题
代码:
class Solution {
public int lastStoneWeightII(int[] stones) {
int sum = 0;
for (int stone : stones) {
sum += stone;
}
int target = sum >> 1;
// 初始化dp数组
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]);
}
}
// 分成两堆石头,一堆石头的总重量是dp[target],另一堆就是sum - dp[target]。
return sum - dp[target] - dp[target];
}
}
Leetcode 494. 目标和
题目链接
思路:01背包问题
代码:
class Solution {
public int findTargetSumWays(int[] nums, int target) {
int sum = 0;
for (int num : nums) {
sum += num;
}
if (Math.abs(target) > sum) {
return 0;
}
if ((target + sum) % 2 == 1) {
return 0;
}
int bagSize = (target + sum) >> 1;
int[] dp = new int[bagSize + 1];
dp[0] = 1;
for (int i = 0; i < nums.length; i++) {
for (int j = bagSize; j >= nums[i]; j--) {
dp[j] += dp[j - nums[i]];
}
}
return dp[bagSize];
}
}
Leetcode 474.一和零
题目链接
思路:01背包问题
代码:
class Solution {
public int findMaxForm(String[] strs, int m, int n) {
// dp[i][j]:最多有i个0和j个1的strs的最大子集的大小
int[][] dp = new int[m + 1][n + 1];
int zeroNum;
int oneNum;
// 遍历物品
for (String str : strs) {
zeroNum = 0;
oneNum = 0;
for (char c : str.toCharArray()) {
if (c == '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];
}
}