具体的背包问题思路问题自己总结在vscode里
1049. 最后一块石头的重量 II
class Solution {
public:
int lastStoneWeightII(vector<int>& stones) {
vector<int> dp(15001, 0);
int sum = 0;
for (int i = 0; i < stones.size(); ++i) sum += stones[i];
int target = sum / 2;
for (int i = 0; i < stones.size(); ++i) {
for (int j = target; j >= stones[i]; --j) {
dp[j] = max(dp[j], dp[j - stones[i]] + stones[i]);
}
}
return sum - dp[target] - dp[target];
}
};
494. 目标和
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int sum = 0;
for (int i = 0; i < nums.size(); ++i) {
sum += nums[i];
}
int left = (sum + target) / 2;
if ((sum + target) % 2 == 1) return 0;
if (abs(target) > sum) return 0;
vector<int> dp(left + 1, 0);
dp[0] = 1;
for (int i = 0; i < nums.size(); ++i) {
for (int j = left; j >= nums[i]; --j) {
dp[j] += dp[j-nums[i]];
}
}
return dp[left];
}
};
474. 一和零
class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
for (string str : strs) {
int zeronum = 0, onenum = 0;
for (auto ch : str) {
if (ch == '0') {
zeronum++;
}
else {
onenum++;
}
}
for (int i = m; i >= zeronum; --i) {
for (int j = n; j >= onenum; --j) {
dp[i][j] = max(dp[i][j], dp[i - zeronum][j - onenum] + 1);
}
}
}
return dp[m][n];
}
};