From a40b5094a93ed10bbec05e96354e570bc4267f19 Mon Sep 17 00:00:00 2001
From: HermanZzz <officialzhanghang@gmail.com>
Date: Wed, 12 May 2021 15:59:24 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00112.=E8=B7=AF=E5=BE=84?=
 =?UTF-8?q?=E6=80=BB=E5=92=8C=20JavaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0112.路径总和.md | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index 40df1e7a..51ee0872 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -312,6 +312,37 @@ Python：
 
 Go：
 
+JavaScript：
+
+```javascript
+/**
+ * @param {TreeNode} root
+ * @param {number} targetSum
+ * @return {boolean}
+ */
+let hasPathSum = function (root, targetSum) {
+  const traversal = (node, cnt) => {
+    // 遇到叶子节点，并且计数为0
+    if (cnt === 0 && !node.left && !node.right) return true;
+    // 遇到叶子节点而没有找到合适的边(计数不为0)，直接返回
+    if (!node.left && !node.right) return false;
+
+    //  左（空节点不遍历）.遇到叶子节点返回true，则直接返回true
+    if (node.left && traversal(node.left, cnt - node.left.val)) return true;
+    //  右（空节点不遍历）  
+    if (node.right && traversal(node.right, cnt - node.right.val)) return true;
+    return false;
+  };
+  if (!root) return false;
+  return traversal(root, targetSum - root.val);
+
+  // 精简代码:
+  // if (!root) return false;
+  // if (!root.left && !root.right && targetSum === root.val) return true;
+  // return hasPathSum(root.left, targetSum - root.val) || hasPathSum(root.right, targetSum - root.val);
+};
+```
+