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:5Explanation:-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 = 3There 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(int[] nums, int S) {
int sum = 0;
for (int num : nums) sum += num;
if (sum < S || ((sum + S) & 1) == 1) return 0;
int target = (sum + S) / 2;
// dp[index][s]: 前index个数加起来和为s的取符号方法数量
int[] dp = new int[target + 1];
dp[0] = 1;
for (int index = 1; index <= nums.length; index++) {
int num = nums[index - 1];
for (int i = target; i >= 0; i--) {
if (i + num <= target) dp[i + num] += dp[i];
}
}
return dp[target];
}
}
