You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols +
and -
. For each integer, you should choose one from +
and -
as its new symbol.
Find out how many ways to assign symbols to make sum of integers equal to target S.
Example 1:
Input: nums is [1, 1, 1, 1, 1], S is 3. Output: 5 Explanation: -1+1+1+1+1 = 3 +1-1+1+1+1 = 3 +1+1-1+1+1 = 3 +1+1+1-1+1 = 3 +1+1+1+1-1 = 3 There are 5 ways to assign symbols to make the sum of nums be target 3.
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int S) {
// 深搜索 当做二叉树 左分支为正 由分支为负
int ret=0;
dfs(nums, S, 0, ret, 0);
}
void dfs(vector<int> &nums, int S, int tmpSum, int &ret, int index){
// 每索引到一个元素 index++ 检索到所有元素后如果和=S ret++
if(index == nums.size()){
if(tmpSum == S) ret++;
}
else{
dfs(nums, S, tmpSum+nums[index], ret, index+1);
dfs(nums, S, tmpSum-nums[index], ret, index+1);
}
}
};
方法二: 转化为dp问题, 按和分数组
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int S) {
/*
* 问题转化: 正数集合P, 负数集合N,两个集合的和 即
* sum(P)-sum(N) = target
* sum(P)+sum(N)+sum(P)-sum(N) = target+sum(P)+sum(N)
* 2*sum(P) = Sum+target
* 转化为划分成两个和相等的集合
*
* 稍微改变的是: dp[i] 表示和为i 的可能组合数
* 之前的 dp[i] = dp[i] || dp[i-num] 要变为
* dp[i] += dp[i-num]
* */
// 注意特判: 如果给定的数太大 可以直接返回
int sum=accumulate(nums.begin(), nums.end(), 0);
if(sum < S || (sum+S) & 1 ) return false;
int target=(sum+S) >> 1;
vector<int> dp(target+1, 0);
dp[0] = 1;
for(auto &num:nums){
for(int i=target;i>=num;i--){
dp[i] += dp[i-num];
}
}
return dp[target];
}
};