LeetCode1049. 最后一块石头的重量 II
题目链接:1049. 最后一块石头的重量 II - 力扣(LeetCode)
思路:
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];
}
};
LeetCode494.目标和
思路:
求组合类问题的公式,都是类似这种:
dp[j] += dp[j - nums[i]]
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((target+sum) % 2 == 1) return 0;//加法的两倍为奇数无方案
int bigsize = (sum + target) / 2;
vector<int> dp(bigsize + 1, 0);
dp[0] = 1;
for(int i = 0; i < nums.size(); i++) {
for(int j = bigsize; j >= nums[i]; j--) {
dp[j] += dp[j - nums[i]];
}
}
return dp[bigsize];
}
};
LeetCode474.一和零
思路:
class Solution {
public:
int findMaxForm(vector<string>& strs, int m, int n) {
vector<vector<int>> dp(m + 1, vector<int> (n + 1, 0));//默认初始化为0
for(string str: strs) {//遍历物品
int oneNum = 0, zeroNum = 0;
for(char c: str) {
if(c == '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];
}
};