Create 494-Target-Sum.java

SharmaTushar1 · web-flow · commit a2bbf7021b85 · 2022-07-06T22:24:16.000+05:30
Just the brute-force solution. If anyone has solved it the efficient way then please add that also.
diff --git a/java/494-Target-Sum.java b/java/494-Target-Sum.java
@@ -0,0 +1,18 @@
+//Brute-force solution (accepted)
+
+class Solution {
+    public int findTargetSumWays(int[] nums, int target) {
+        return helper(nums, target, nums.length, 0);
+    }
+    
+    public int helper(int[] nums, int target, int n, int temp) {
+        if (n == 0) {
+            if (target == temp) return 1;
+            else return 0;
+        }
+        else {
+            return helper(nums, target-nums[n-1], n-1, temp) + helper(nums, target+nums[n-1], n-1, temp);
+        }
+    }
+    
+}
