From 766af43f4e4409f953b96c27ab7ff252a5802b35 Mon Sep 17 00:00:00 2001
From: jerryfishcode <91447694+jerryfishcode@users.noreply.github.com>
Date: Tue, 28 Sep 2021 00:38:48 +0800
Subject: [PATCH] =?UTF-8?q?=E6=96=B0=E5=A2=9E129.=20=E6=B1=82=E6=A0=B9?=
 =?UTF-8?q?=E8=8A=82=E7=82=B9=E5=88=B0=E5=8F=B6=E8=8A=82=E7=82=B9=E6=95=B0?=
 =?UTF-8?q?=E5=AD=97=E4=B9=8B=E5=92=8C=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0129.求根到叶子节点数字之和.md b/problems/0129.求根到叶子节点数字之和.md
index 696042a8..9a671404 100644
--- a/problems/0129.求根到叶子节点数字之和.md
+++ b/problems/0129.求根到叶子节点数字之和.md
@@ -241,6 +241,48 @@ class Solution:
 Go：
 
 JavaScript：
+```javascript
+var sumNumbers = function(root) {
+    const listToInt = path => {
+        let sum = 0;
+        for(let num of path){
+            // sum * 10 表示进位
+            sum = sum * 10 + num;
+        }
+        return sum;
+    }
+    const recur = root =>{
+        if (root.left == null && root.right == null) {
+            // 当是叶子节点的时候，开始处理
+            res += listToInt(path);
+            return;
+        }
+
+        if (root.left != null){
+            // 注意有回溯
+            path.push(root.left.val);
+            recur(root.left);
+            path.pop();
+        }
+        if (root.right != null){
+            // 注意有回溯
+            path.push(root.right.val);
+            recur(root.right);
+            path.pop();
+        }
+        return;
+    };
+    const path = new Array();
+    let res = 0;
+    // 如果节点为0，那么就返回0
+    if (root == null) return 0;
+    // 首先将根节点放到集合中
+    path.push(root.val);
+    // 开始递归
+    recur(root);
+    return res;
+};
+```