1049. 最后一块石头的重量 II
题目链接
1049. 最后一块石头的重量 II
我的题解
class Solution {
public:
int lastStoneWeightII(vector<int>& stones) {
int sum = accumulate(stones.begin(), stones.end(), 0);
int target = sum / 2;
vector<int> dp(target + 1, 0);
for (int i = 0; i < stones.size(); i ++) {
//dp[j] = max(dp[j], dp[j - stone[i]] + stone[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. 目标和
题目链接
494. 目标和
我的题解
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int sum = accumulate(nums.begin(), nums.end(), 0);
if (sum < abs(target)) return 0;
if ((sum + target) % 2 == 1) return 0;
int bag_size = (sum + target) / 2;
vector<int> dp(bag_size + 1, 0);
dp[0] = 1;
for (int i = 0; i < nums.size(); i ++) {
for (int j = bag_size; j >= nums[i]; j --) {
dp[j] += dp[j - nums[i]];
}
}
return dp[bag_size];
}
};
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 (auto str : strs) {
int cnt0 = 0, cnt1 = 0;
for (auto ch : str) {
if (ch == '0') cnt0 ++;
else cnt1 ++;
}
for (int i = m; i >= cnt0; i --) {
for (int j = n; j >= cnt1; j --) {
dp[i][j] = max(dp[i][j], dp[i - cnt0][j - cnt1] + 1);
}
}
}
return dp[m][n];
}
};