From 023ec6900a759e030712edf5362b65569935df75 Mon Sep 17 00:00:00 2001
From: Guanzhong Pan <gpan20020205@gmail.com>
Date: Thu, 27 Jan 2022 13:43:43 +0000
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200129.=E6=B1=82=E6=A0=B9?=
 =?UTF-8?q?=E5=88=B0=E5=8F=B6=E5=AD=90=E8=8A=82=E7=82=B9=E6=95=B0=E5=AD=97?=
 =?UTF-8?q?=E4=B9=8B=E5=92=8C.md=20C=E8=AF=AD=E8=A8=80=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0129.求根到叶子节点数字之和.md | 26 +++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/problems/0129.求根到叶子节点数字之和.md b/problems/0129.求根到叶子节点数字之和.md
index d07d5244..980779c2 100644
--- a/problems/0129.求根到叶子节点数字之和.md
+++ b/problems/0129.求根到叶子节点数字之和.md
@@ -289,7 +289,33 @@ var sumNumbers = function(root) {
 };
 ```
 
+C:
+```c
+//sum记录总和
+int sum;
+void traverse(struct TreeNode *node, int val) {
+    //更新val为根节点到当前节点的和
+    val = val * 10 + node->val;
+    //若当前节点为叶子节点，记录val
+    if(!node->left && !node->right) {
+        sum+=val;
+        return;
+    }
+    //若有左/右节点，遍历左/右节点
+    if(node->left) 
+        traverse(node->left, val);
+    if(node->right)
+        traverse(node->right, val);
+}
 
+int sumNumbers(struct TreeNode* root){
+    sum = 0;
+    
+    traverse(root, 0);
+
+    return sum;
+}
+```
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>