From d6a37be6f21083a1e4bcae7fe167c1bca583fee4 Mon Sep 17 00:00:00 2001
From: a12bb <2713204748@qq.com>
Date: Thu, 7 Mar 2024 20:03:10 +0800
Subject: [PATCH] =?UTF-8?q?Update=200494.=E7=9B=AE=E6=A0=87=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

0494.目标和新增C语言实现
---
 problems/0494.目标和.md | 36 +++++++++++++++++++++++++++++++++++-
 1 file changed, 35 insertions(+), 1 deletion(-)

diff --git a/problems/0494.目标和.md b/problems/0494.目标和.md
index e7a05d45..8d1a34e5 100644
--- a/problems/0494.目标和.md
+++ b/problems/0494.目标和.md
@@ -585,7 +585,42 @@ impl Solution {
     }
 }
 ```
+```c
+int getSum(int * nums, int numsSize){
+    int sum = 0;
+    for(int i = 0; i < numsSize; i++){
+        sum += nums[i];
+    }
+    return sum;
+}
+
+int findTargetSumWays(int* nums, int numsSize, int target) {
+    int sum = getSum(nums, numsSize);
+    int diff = sum - target;
+    // 两种情况不满足
+    if(diff < 0 || diff % 2 != 0){
+        return 0;
+    }
+    int bagSize = diff / 2;
+    int dp[numsSize + 1][bagSize + 1];
+    dp[0][0] = 1;
+    for(int i = 1; i <= numsSize; i++){
+        int num = nums[i - 1];
+        for(int j = 0; j <= bagSize; j++){
+            dp[i][j] = dp[i - 1][j];
+            if(j >= num){
+                dp[i][j] += dp[i - 1][j - num];
+            }
+        }
+    }
+    return dp[numsSize][bagSize];
+}
+```
+
+
+
 ### C#
+
 ```csharp
 public class Solution
 {
@@ -617,4 +652,3 @@ public class Solution
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
-