https://leetcode.cn/problems/partition-equal-subset-sum/ https://leetcode.cn/problems/NUPfPr/

Author: masx200

NUPfPr/index.ts

@@ -0,0 +1,3 @@
+import canPartition from "../partition-equal-subset-sum/index.ts";
+
+export default canPartition;

README.md

@@ -45,6 +45,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/partition-equal-subset-sum/
+
+https://leetcode.cn/problems/NUPfPr/
+
 https://leetcode.cn/problems/number-of-matching-subsequences
 
 https://leetcode.cn/problems/is-subsequence/

partition-equal-subset-sum/index.ts

@@ -0,0 +1,13 @@
+export default function canPartition(nums: number[]): boolean {
+    const sum: number = nums.reduce((pre, cur) => pre + cur);
+    if (sum % 2 === 1) return false;
+    const bagSize: number = sum / 2;
+    const goodsNum: number = nums.length;
+    const dp: number[] = new Array(bagSize + 1).fill(0);
+    for (let i = 0; i < goodsNum; i++) {
+        for (let j = bagSize; j >= nums[i]; j--) {
+            dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
+        }
+    }
+    return dp[bagSize] === bagSize;
+}