class Solution {
public:
int lastStoneWeightII(vector<int>& stones) {
vector<int> dp(1501, 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];
if (abs(target) > sum) return 0;
if ((sum + target) % 2 == 1) return 0;
int bagsize = (sum + target) / 2;
vector<int> dp(bagsize + 1, 0);
dp[0] = 1;
for (int i = 0; i < nums.size(); i++) {
for (int j = bagsize; j >= nums[i]; j--) {
dp[j] += dp[j - nums[i]];
}
}
return dp[bagsize];
}
};
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 oneN = 0, zeroN = 0;
for (char c : str) {
if (c == '0') zeroN++;
else oneN++;
}
for (int i = m; i >= zeroN; i--) {
for (int j = n; j >= oneN; j--) {
dp[i][j] = max(dp[i][j], dp[i - zeroN][j - oneN] + 1);
}
}
}
return dp[m][n];
}
};