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.
原题链接
本题的要求是给定一个数组和目标值,使用“+”或“-”使n个值的运算和等于目标值。
1、解法一:
首先分析一下这个题目,实际上就是把每个数都做加法运算,只不过每个数可以是正的或负的,如果将整个过程用如下图表示:
如图,所有的情况很容易形成一个二叉树,每次从根到叶子即可形成一个可能的结果,只要遍历整棵树即可,很自然想到树的深度遍历,利用递归即可。
public class Solution {
public int findTargetSumWays(int[] nums, int S) {
helper(nums,0,0,S);
return count;
}
int count=0;
public void helper(int[] nums,int index,int sum,int S){
if (index>=nums.length){
if(sum==S)
count++;
return;
}
helper(nums,index+1,sum+nums[index],S);
helper(nums,index+1,sum-nums[index],S);
}
}
2、解法一虽然简单,但是类似于暴力求解,下面介绍一下用动态规划的做法。
以下是代码,可击败68%。
public class Solution {
public int findTargetSumWays(int[] nums, int S) {
int sum = 0;
for(int i = 0 ; i < nums.length; i++){
sum += nums[i];
nums[i] <<= 1;
}
if(S > sum) return 0;
return find(nums, S + sum);
}
public int find(int[] nums, int S) {
int[][] dp = new int[nums.length + 1][S + 1];
dp[0][0] = 1;
for(int i = 1; i <= nums.length; i++) {
for(int j = 0; j <= S; j++) {
dp[i][j] = dp[i - 1][j];
int now = nums[i - 1];
if(j - now >= 0)dp[i][j] += dp[i - 1][j - now];
}
}
return dp[nums.length][S];
}
}