494. 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.

思路1：可以将其看做一个深度优先搜索的过程

void DFS_help(vector<int>&nums, int pos, int sum, int S,int &cnt){
    if (pos == nums.size()){
        if (sum == S)cnt++;
        return;
    }
    DFS_help(nums, pos + 1, sum + nums[pos], S, cnt);
    DFS_help(nums, pos + 1, sum - nums[pos], S, cnt);
}

int findTargetSumWays(vector<int>& nums, int S) {
    if (nums.size() <= 0)return 0;
    int cnt = 0;
    DFS_help(nums, 0, 0, S, cnt);
    return cnt;
}

思路2：

转化问题
我们是在一些数前面添加+，一些数前面添加-。我们把添加+的数记为集合P，添加-的数记为集合N。
比如{1, 2, 3, 4, 5}, target = 3。如果我们这么添加：+1 - 2 + 3 - 4 + 5 = 3。则P = {1, 3, 5}, N = {2, 4}。
那么，我们可以得到如下公式：
(1) sum(P)−sum(N)=target
(2) sum(P)+sum(N)=sum
(1)+(2)得到：2sum(P)=target+sum
所以，我们的问题就转化成了：在nums[]找一个子集P，使P的和为 (targt+sum)/2。

int subsetSum(vector<int>& nums, int s){
    vector<int> dp(s + 1, 0);
    dp[0] = 1;
    for (auto num : nums){
        for (int i = s; i >= num; i--){
            dp[i] += dp[i - num];
        }
    }
    return dp[s];
}

int findTargetSumWays(vector<int>& nums, int S) {
    int sum = 0;
    for (auto x : nums)sum += x;
    return sum < S || (S + sum) & 1 ? 0 : subsetSum(nums, (S + sum) >> 1);
}