-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram15.java
More file actions
59 lines (37 loc) · 1.36 KB
/
program15.java
File metadata and controls
59 lines (37 loc) · 1.36 KB
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
/*
494. Target Sum
Medium
9.2K
312
Companies
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
*/
package LeetCode;
public class program15 {
static int findTargetSumWays(int[] nums, int target) {
int cnt=0;
for(int i=0;i<nums.length;i++){
}
return cnt;
}
public static void main(String[] args) {
int[] nums= {1,1,1,1,1};
int target =3;
System.out.println(findTargetSumWays(nums, target));
}
}