(nums, target, index = 0, sum = 0)
| 7 | * @return {number} |
| 8 | */ |
| 9 | var findTargetSumWays = (nums, target, index = 0, sum = 0) => { |
| 10 | const isBaseCase = index === nums.length; |
| 11 | if (isBaseCase) { |
| 12 | const isTarget = sum === target; |
| 13 | if (isTarget) return 1; |
| 14 | |
| 15 | return 0; |
| 16 | } |
| 17 | |
| 18 | return dfs(nums, target, index, sum); /* Time O(2^N) | Space O(HEIGHT) */ |
| 19 | }; |
| 20 | |
| 21 | var dfs = (nums, target, index, sum) => { |
| 22 | const left = findTargetSumWays( |