动态规划哈哈,真好玩!!!!!
1049. 最后一块石头的重量 II、
1049. 最后一块石头的重量 II - 力扣(LeetCode)
class Solution {
public:
// 类背包问题,最靠近一半和的容量背包最多能装多少重量
int lastStoneWeightII(vector<int>& stones) {
int sum = 0;
for(int stone : stones){
sum += stone;
}
int dpSize = sum / 2;
vector<int> dp(dpSize + 1, 0);
for(int i = 0; i < stones.size(); i++){
for(int j = dpSize; j >= stones[i]; j--){
dp[j] = max(dp[j], dp[j - stones[i]] + stones[i]);
}
}
return sum - dp[dpSize] - dp[dpSize];
}
};
494. 目标和
class Solution {
public:
// sum1 - sum2 = target
// sum1 + sum2 = sum
int findTargetSumWays(vector<int>& nums, int target) {
int sum = 0;
for(int num : nums){
sum +=num;
}
if((sum + target) % 2 != 0 || abs(sum) < abs(target))
{
return 0;
}
int dpEnd = abs(target + sum) / 2;
vector<int> dp(dpEnd + 1, 0);
dp[0] = 1;
for(int i = 0; i < nums.size(); i++){
for(int j = dpEnd; j >= nums[i]; j--){
dp[j] += dp[j - nums[i]];
}
}
return dp[dpEnd];
}
};
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(int i = 0; i < strs.size(); i++){
int zeroNum = charCount(strs[i], '0');
int oneNum = charCount(strs[i], '1');
for(int j = m; j >= zeroNum; j--){
for(int k = n; k >= oneNum; k--){
dp[j][k] = max(dp[j][k], dp[j - zeroNum][k - oneNum] + 1);
}
}
}
return dp[m][n];
}
private:
int charCount(const string &str, char a){
int count = 0;
for(char ca : str){
if(ca == a){
count++;
}
}
return count;
}
};