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.

题意

给一组数nums, 在每个数前面加+或-,求他们的和, 问和为S的有多少种情况

dfs

每个数都能分支出两种情况, 可以看成一个二叉树, 用dfs穷举, 看叶子节点和为S的有多少个.
效率比较低, 花了 436 ms

dfs实现

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int S) {
        int res = 0;
        dfs(nums, S, res, 0, 0);
        return res;
    }

    void dfs(vector<int>& nums, int S, int& res, int index, int localSum) {
        if (index == nums.size()) {
            if (localSum == S)
                res++;
            return;
        }
        dfs(nums, S, res, index+1, localSum+nums[index]);
        dfs(nums, S, res, index+1, localSum-nums[index]);
    }
};

数学转换和dp

加入“+”和“-”之后原数组的元素可以看成被分成了两个子集合，一个正的子集合P，另一个负的子集合N。

For example:
Given nums = [1, 2, 3, 4, 5] and S = 3 
then one possible solution is 
    +1-2+3-4+5 = 3 
    Here positive subset is P = [1, 3, 5] 
    and negative subset is N = [2, 4]

令$sum(P)$表示集合$P$所有元素之和，$sum(N)$表示集合$N$所有元素之和, $S$为要求的和
已知$sum(P) - sum(N) = S$
有$sum(P) + sum(N) + sum(P) - sum(N) = S+ sum(P) + sum(N)$
则$2 * sum(P) = S+ sum(nums)$
问题转化为求原集合中的一个子集，使得子集所有元素和满足
$sum(P) = （target + sum(nums)）/2$
可以理解为求和为上式的集合, 也就是01背包问题

dp实现

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int S) {
        int numsSum = 0;
        for (auto num : nums)
            numsSum += num;
        if (numsSum < S || (numsSum + S) % 2 != 0) return 0;

        int target = (numsSum + S) / 2;
        std::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];
    }
};

动态规划效率明显比dfs穷举要高, 只花费了9 ms