From 399da9102734edbf313584b3c5e21a201911c798 Mon Sep 17 00:00:00 2001
From: Arthur <gpan20020205@gmail.com>
Date: Sat, 11 Sep 2021 10:37:53 +0100
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200039.=E7=BB=84=E5=90=88?=
 =?UTF-8?q?=E6=80=BB=E5=92=8C.md=20C=E8=AF=AD=E8=A8=80=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...04\345\220\210\346\200\273\345\222\214.md" | 54 +++++++++++++++++++
 1 file changed, 54 insertions(+)

diff --git "a/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md" "b/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md"
index 8cea3b9e89..97987e6d91 100644
--- "a/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md"
+++ "b/problems/0039.\347\273\204\345\220\210\346\200\273\345\222\214.md"
@@ -346,6 +346,60 @@ var combinationSum = function(candidates, target) {
 };
 ```
 
+C:
+```c
+int* path;
+int pathTop;
+int** ans;
+int ansTop;
+//记录每一个和等于target的path数组长度
+int* length;
+
+void backTracking(int target, int index, int* candidates, int candidatesSize, int sum) {
+    //若sum>=target就应该终止遍历
+    if(sum >= target) {
+        //若sum等于target，将当前的组合放入ans数组中
+        if(sum == target) {
+            int* tempPath = (int*)malloc(sizeof(int) * pathTop);
+            int j;
+            for(j = 0; j < pathTop; j++) {
+                tempPath[j] = path[j];
+            }
+            ans[ansTop] = tempPath;
+            length[ansTop++] = pathTop;
+        }
+        return ;
+    }
+
+    int i;
+    for(i = index; i < candidatesSize; i++) {
+        //将当前数字大小加入sum
+        sum+=candidates[i];
+        path[pathTop++] = candidates[i];
+        backTracking(target, i, candidates, candidatesSize, sum);
+        sum-=candidates[i];
+        pathTop--;
+    }
+}
+
+int** combinationSum(int* candidates, int candidatesSize, int target, int* returnSize, int** returnColumnSizes){
+    //初始化变量
+    path = (int*)malloc(sizeof(int) * 50);
+    ans = (int**)malloc(sizeof(int*) * 200);
+    length = (int*)malloc(sizeof(int) * 200);
+    ansTop = pathTop = 0;
+    backTracking(target, 0, candidates, candidatesSize, 0);
+
+    //设置返回的数组大小
+    *returnSize = ansTop;
+    *returnColumnSizes = (int*)malloc(sizeof(int) * ansTop);
+    int i;
+    for(i = 0; i < ansTop; i++) {
+        (*returnColumnSizes)[i] = length[i];
+    }
+    return ans;
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)