[LeetCode Sync] Runtime - 20 ms (91.05%), Memory - 17.9 MB (89.39%)

Author: NinePiece2

Solutions/0494-target-sum/README.md

@@ -0,0 +1,40 @@
+<p>You are given an integer array <code>nums</code> and an integer <code>target</code>.</p>
+
+<p>You want to build an <strong>expression</strong> out of nums by adding one of the symbols <code>&#39;+&#39;</code> and <code>&#39;-&#39;</code> before each integer in nums and then concatenate all the integers.</p>
+
+<ul>
+	<li>For example, if <code>nums = [2, 1]</code>, you can add a <code>&#39;+&#39;</code> before <code>2</code> and a <code>&#39;-&#39;</code> before <code>1</code> and concatenate them to build the expression <code>&quot;+2-1&quot;</code>.</li>
+</ul>
+
+<p>Return the number of different <strong>expressions</strong> that you can build, which evaluates to <code>target</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1,1,1], target = 3
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> There are 5 ways to assign symbols to make the sum of nums be target 3.
+-1 + 1 + 1 + 1 + 1 = 3
++1 - 1 + 1 + 1 + 1 = 3
++1 + 1 - 1 + 1 + 1 = 3
++1 + 1 + 1 - 1 + 1 = 3
++1 + 1 + 1 + 1 - 1 = 3
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1], target = 1
+<strong>Output:</strong> 1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 20</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>
+	<li><code>0 &lt;= sum(nums[i]) &lt;= 1000</code></li>
+	<li><code>-1000 &lt;= target &lt;= 1000</code></li>
+</ul>

Solutions/0494-target-sum/solution.py

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