From b1b389da3204c4faf0c65519e8f58cf59afe18d4 Mon Sep 17 00:00:00 2001
From: xll <18574553598@163.com>
Date: Sat, 29 May 2021 22:20:52 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=E8=B7=AF=E5=BE=84?=
 =?UTF-8?q?=E6=80=BB=E5=92=8CJavaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
index b4a3f38b..4ccd8912 100644
--- a/problems/0112.路径总和.md
+++ b/problems/0112.路径总和.md
@@ -524,6 +524,62 @@ let pathSum = function (root, targetSum) {
 };
 ```
 
+0112 路径总和
+```javascript
+var hasPathSum = function(root, targetSum) {
+    //递归方法
+    // 1. 确定函数参数
+    const traversal = function(node,count){
+        // 2. 确定终止条件
+        if(node.left===null&&node.right===null&&count===0){
+            return true;
+        }
+        if(node.left===null&&node.right===null){
+            return false;
+        }
+        //3. 单层递归逻辑
+        if(node.left){
+            if(traversal(node.left,count-node.left.val)){
+                return true;
+            }
+        }
+        if(node.right){
+            if(traversal(node.right,count-node.right.val)){
+                return true;
+            }
+        }
+        return false;
+    }
+    if(root===null){
+        return false;
+    }
+    return traversal(root,targetSum-root.val);
+};
+```
+113 路径总和
+```javascript
+var pathSum = function(root, targetSum) {
+    //递归方法
+    let resPath = [],curPath = [];
+    // 1. 确定递归函数参数
+    const travelTree = function(node,count){
+        curPath.push(node.val);
+        count-=node.val;
+        if(node.left===null&&node.right===null&&count===0){
+            resPath.push([...curPath]);
+        }
+        node.left&&travelTree(node.left,count);
+        node.right&&travelTree(node.right,count);
+        let cur = curPath.pop();
+        count-=cur;
+    }
+    if(root===null){
+        return resPath;
+    }
+    travelTree(root,targetSum);
+    return resPath;
+};
+```