解题思路:
//官方代码:
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int sum = 0;
for (int& num : nums) {
sum += num;
}
int diff = sum - target;
if (diff < 0 || diff % 2 != 0) {
return 0;
}
int n = nums.size(), neg = diff / 2;
vector<vector<int>> dp(n + 1, vector<int>(neg + 1));
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
int num = nums[i - 1];
for (int j = 0; j <= neg; j++) {
dp[i][j] = dp[i - 1][j];
if (j >= num) {
dp[i][j] += dp[i - 1][j - num];
}
}
}
return dp[n][neg];
}
};
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/target-sum/solution/mu-biao-he-by-leetcode-solution-o0cp/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int target) {
int len=nums.size();
int dp[1100]={0};//dp数组大小为deg的大小!!注意01背包的含义
dp[0]=1;
int sum=0;
for(int i=0;i<len;i++)
{
sum+=nums[i];
}
if(sum<target||(sum-target)%2!=0)
{
return 0;
}
else
{
//这个拆分很巧妙!!注意思路!!
int neg=(sum-target)/2;//期望达到的目标值deg,所以背包是从0-deg
for(int i=0;i<len;i++)
{
for(int j=neg;j>=nums[i];j--)//注意有等号而且是倒序
{
dp[j]=dp[j-nums[i]]+dp[j];
//本质上是dp[j]=max(dp[j],dp[j-nums[i]]+dp[j]);但由于肯定后者大,所以写成上面的形式
}
}
return dp[neg];
}
}
};