From d692ffe034aa1d7af9a4e5d76999ee6a506c23b9 Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Tue, 3 May 2022 21:51:21 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880416.=E5=88=86?=
 =?UTF-8?q?=E5=89=B2=E7=AD=89=E5=92=8C=E5=AD=90=E9=9B=86.md=EF=BC=89?=
 =?UTF-8?q?=EF=BC=9A=E5=A2=9E=E5=8A=A0typescript?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0416.分割等和子集.md | 55 +++++++++++++++++++++++++++++
 1 file changed, 55 insertions(+)

diff --git a/problems/0416.分割等和子集.md b/problems/0416.分割等和子集.md
index b24fb365..20b7782d 100644
--- a/problems/0416.分割等和子集.md
+++ b/problems/0416.分割等和子集.md
@@ -416,6 +416,61 @@ var canPartition = function(nums) {
 };
 ```
 
+TypeScript:
+
+> 一维数组，简洁
+
+```typescript
+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;
+};
+```
+
+> 二维数组，易懂
+
+```typescript
+function canPartition(nums: number[]): boolean {
+    /**
+        weightArr = nums;
+        valueArr = nums;
+        bagSize = sum / 2; (sum为nums各元素总和);
+        按照0-1背包处理
+     */
+    const sum: number = nums.reduce((pre, cur) => pre + cur);
+    if (sum % 2 === 1) return false;
+    const bagSize: number = sum / 2;
+    const weightArr: number[] = nums;
+    const valueArr: number[] = nums;
+    const goodsNum: number = weightArr.length;
+    const dp: number[][] = new Array(goodsNum)
+    	.fill(0)
+    	.map(_ => new Array(bagSize + 1).fill(0));
+    for (let i = weightArr[0]; i <= bagSize; i++) {
+        dp[0][i] = valueArr[0];
+    }
+    for (let i = 1; i < goodsNum; i++) {
+        for (let j = 0; j <= bagSize; j++) {
+            if (j < weightArr[i]) {
+                dp[i][j] = dp[i - 1][j];
+            } else {
+                dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - weightArr[i]] + valueArr[i]);
+            }
+        }
+    }
+    return dp[goodsNum - 1][bagSize] === bagSize;
+};
+```
+