(nums)
| 6 | * @return {boolean} |
| 7 | */ |
| 8 | var canPartition = (nums) => { |
| 9 | const sum = getSum(nums); /* Time O(N) */ |
| 10 | const subSetSum = sum / 2; |
| 11 | |
| 12 | const isEven = sum % 2 === 0; |
| 13 | if (!isEven) return false; |
| 14 | |
| 15 | const index = nums.length - 1; |
| 16 | |
| 17 | return dfs(nums, index, subSetSum); |
| 18 | }; |
| 19 | |
| 20 | var getSum = (nums, sum = 0) => { |
| 21 | for (const num of nums) sum += num; /* Time O(N) */ |