-
Notifications
You must be signed in to change notification settings - Fork 590
/
Copy pathtarget_sum.cpp
79 lines (52 loc) · 1.62 KB
/
target_sum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
// Target Sum
/*
You are given an integer array nums and an integer target.
You want to build an expression out of nums by adding one of the symbols '+' and '-' before each integer in nums and then concatenate all the integers.
For example, if nums = [2, 1], you can add a '+' before 2 and a '-' before 1 and concatenate them to build the expression "+2-1".
Return the number of different expressions that you can build, which evaluates to target.
Example 1:
Input: nums = [1,1,1,1,1], target = 3
Output: 5
Explanation: There are 5 ways to assign symbols to make the sum of nums be target 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
+1 + 1 + 1 + 1 - 1 = 3
Example 2:
Input: nums = [1], target = 1
Output: 1
*/
class Solution {
public:
int count(vector<int>&nums, int s)
{
int i,j,n;
n=nums.size();
int t[n+1][s+1];
for(i=0;i<=n;i++)
t[i][0]=1;
for(j=1;j<=s;j++)
t[0][j]=0;
for(i=1;i<=n;i++)
{
for(j=0;j<=s;j++)
{
if(nums[i-1]<=j)
t[i][j]=t[i-1][j]+t[i-1][j-nums[i-1]];
else
t[i][j]=t[i-1][j];
}
}
return t[n][s];
}
int findTargetSumWays(vector<int>& nums, int target)
{
int s=0;
s=accumulate(nums.begin(),nums.end(),s);
if(s<target || (s+target)%2!=0)
return 0;
int s1=(s+target)/2;
return count(nums,abs(s1));
}
};