LintCode 1208 · Target Sum (回溯和DP好题)

1208 · Target Sum
Algorithms
Medium

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

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.
Example
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.
Example 2:

Input: nums is [], S is 3.
Output: 0
Explanation:
There are 0 way to assign symbols to make the sum of nums be target

解法1：回溯

class Solution {
public:
    /**
     * @param nums: the given array
     * @param s: the given target
     * @return: the number of ways to assign symbols to make sum of integers equal to target S
     */
    int findTargetSumWays(vector<int> &nums, int s) {
        helper(nums, 0, 0, s);
        return targetSum;
    }
private:
    int targetSum = 0;
    void helper(vector<int> &nums, int pos, int sum, int s) {
        if (pos == nums.size()) {
            if (sum == s) targetSum++;
            return;
        }
        helper(nums, pos + 1, sum + nums[pos], s);
        helper(nums, pos + 1, sum - nums[pos], s);
        return;
    }
};

解法2：DP
TBD