复习:
class Solution {
public:
int lastStoneWeightII(vector<int>& stones) {
// 目标重量 sum/2
int sum = 0;
for(int stone:stones) {
sum += stone;
}
// 目标 dp[target] - 背包的重量
int target = sum/2;
vector<int> dp(15001, 0);
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];
}
};
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int sum = 0;
for(int num:nums) {
sum += num;
}
if(abs(target)>sum) return false;
if((target+sum)%2!=0) return false;
int left = (target+sum)/2;
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];
}
};