Sync LeetCode submission Runtime - 51 ms (91.86%), Memory - 16.8 MB (71.94%)

Author: koralkulacoglu

LeetCode/0416-partition-equal-subset-sum/README.md

@@ -0,0 +1,26 @@
+<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or </em><code>false</code><em> otherwise</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,5,11,5]
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The array can be partitioned as [1, 5, 5] and [11].
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,5]
+<strong>Output:</strong> false
+<strong>Explanation:</strong> The array cannot be partitioned into equal sum subsets.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 200</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

LeetCode/0416-partition-equal-subset-sum/solution.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    bool canPartition(vector<int>& nums) {
+        int n = nums.size();
+        int m = accumulate(nums.begin(), nums.end(), 0);
+        if (m%2) return false;
+        vector<bool> dp(m/2+1, false);
+        dp[0] = true;
+        if (nums[0] <= m/2) dp[nums[0]] = true;
+        for (int i=1; i<n; i++) {
+            vector<bool> newDp = dp;
+            newDp[nums[i]] = true;
+            for (int j=0; j<=m/2; j++) {
+                if (!dp[j] || nums[i] + j > m/2) continue;
+                newDp[nums[i] + j] = true;
+            }
+            dp = newDp;
+        }
+        return dp[m/2];
+    }
+};