- 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.
class Solution {
public:
int findTargetSumWays(vector<int>& nums, int S) {
return helper(nums, S, 0, 0);
}
int helper(vector<int>& nums, int S, int cur, int start){
if(start == nums.size()){
if(cur == S){
return 1;
} else{
return 0;
}
}
return helper(nums, S, cur + nums[start], start + 1) + helper(nums, S, cur - nums[start], start + 1);
}
};