class Solution {
public:
int lastStoneWeightII(vector<int>& stones) {
int sum = 0;
for(int stone:stones) {
sum += stone;
}
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];
}
};
想法:left - 加法集合、right - 减法集合
left+right = sum
left-right = target --> left - (sum-left) = target --> left = (target+sum)/2
拆分正数集合和复数集合,凑出对应的值left
递归:nums[i] - 本次要加的数量,必须保证之前所能装的数量还有 j-i个
dp[j-nums[i]] + 本次的
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 bagSize = (target+sum)/2;
// 容量为j 有dp[j]种方法
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];
}
};