From 064e582b1e74826e3b60b379aff9c3ee3c41d689 Mon Sep 17 00:00:00 2001
From: eeee0717 <chentao020717Work@outlook.com>
Date: Wed, 17 Jan 2024 10:37:45 +0800
Subject: [PATCH] =?UTF-8?q?Update=200416.=E5=88=86=E5=89=B2=E7=AD=89?=
 =?UTF-8?q?=E5=92=8C=E5=AD=90=E9=9B=86=EF=BC=8C=E6=B7=BB=E5=8A=A0C#?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0416.分割等和子集.md b/problems/0416.分割等和子集.md
index 81eb4c80..71e01ae3 100644
--- a/problems/0416.分割等和子集.md
+++ b/problems/0416.分割等和子集.md
@@ -726,7 +726,35 @@ object Solution {
   }
 }
 ```
+### C#
+```csharp
+public class Solution
+{
+    public bool CanPartition(int[] nums)
+    {
+        int sum = 0;
+        int[] dp = new int[10001];
+        foreach (int num in nums)
+        {
+            sum += num;
+        }
+        if (sum % 2 == 1) return false;
+        int tartget = sum / 2;
+        for (int i = 0; i < nums.Length; i++)
+        {
+            for (int j = tartget; j >= nums[i]; j--)
+            {
+                dp[j] = Math.Max(dp[j], dp[j - nums[i]] + nums[i]);
+            }
+        }
+        if (dp[tartget] == tartget)
+            return true;
 
+        return false;
+
+    }
+}
+```
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>