Time: 19 ms (95.68%), Space: 17.7 MB (96.05%) - LeetHub

Author: wlsgur11

0494-target-sum/0494-target-sum.py

@@ -0,0 +1,17 @@
+class Solution:
+    def findTargetSumWays(self, nums: List[int], target: int) -> int:
+        total = sum(nums)
+
+        if (target + total) % 2 != 0 or abs(target) > total:
+            return 0
+
+        subset_sum = (target + total) // 2
+
+        dp = [0] * (subset_sum + 1)
+        dp[0] = 1
+
+        for num in nums:
+            for j in range(subset_sum, num - 1, -1):
+                dp[j] += dp[j - num]
+
+        return dp[subset_sum]