(int[] nums, int i, int sum, int S)
| 9 | } |
| 10 | |
| 11 | public int calculate(int[] nums, int i, int sum, int S) { |
| 12 | String s = i + "," + sum; |
| 13 | |
| 14 | if (i == nums.length) { |
| 15 | return (sum == S)? 1 : 0; |
| 16 | } |
| 17 | if(dp.containsKey(s)){ |
| 18 | return dp.get(s); |
| 19 | } |
| 20 | |
| 21 | int res = calculate(nums, i + 1, sum + nums[i], S) + calculate(nums, i + 1, sum - nums[i], S); |
| 22 | dp.put(s, res); |
| 23 | return res; |
| 24 | } |
| 25 | } |
| 26 | |
| 27 | /* Alternative Better Complexity Solution |
no test coverage detected