题目链接:https://leetcode.com/problems/target-sum/
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.
Note:
- The length of the given array is positive and will not exceed 20.
- The sum of elements in the given array will not exceed 1000.
- Your output answer is guaranteed to be fitted in a 32-bit integer.
class Solution{
public:
int findTargetSumWays(vector<int>& nums,int S)
{
int count=0;
dfs(nums,count,0,0,S);
return count;
}
void dfs(vector<int>& nums,int &count,int sum,int index,int S)
{
if (index==nums.size())
{
if(sum==S)
count+=1;
return;
}
dfs(nums,count,sum+nums[index],index+1,S);
dfs(nums,count,sum-nums[index],index+1,S);
}
};