From c01a968b92f97c98433432bfabc769c22d5f0f1c Mon Sep 17 00:00:00 2001
From: xll <18574553598@163.com>
Date: Fri, 28 May 2021 11:05:37 +0800
Subject: [PATCH] =?UTF-8?q?0404=E5=B7=A6=E5=8F=B6=E5=AD=90=E4=B9=8B?=
 =?UTF-8?q?=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/0404.左叶子之和.md | 46 +++++++++++++++++++++++++++++++-
 1 file changed, 45 insertions(+), 1 deletion(-)

diff --git a/problems/0404.左叶子之和.md b/problems/0404.左叶子之和.md
index 30d702b4..e5daa9db 100644
--- a/problems/0404.左叶子之和.md
+++ b/problems/0404.左叶子之和.md
@@ -226,7 +226,51 @@ class Solution:
 ```
 Go：
 
-
+JavaScript:
+递归版本
+```javascript
+var sumOfLeftLeaves = function(root) {
+    //采用后序遍历 递归遍历
+    // 1. 确定递归函数参数
+    const nodesSum = function(node){
+        // 2. 确定终止条件
+        if(node===null){
+            return 0;
+        }
+        let leftValue = sumOfLeftLeaves(node.left);
+        let rightValue = sumOfLeftLeaves(node.right);
+        // 3. 单层递归逻辑
+        let midValue = 0;
+        if(node.left&&node.left.left===null&&node.left.right===null){
+            midValue = node.left.val;
+        }
+        let sum = midValue + leftValue + rightValue;
+        return sum;
+    }
+    return nodesSum(root);
+};
+```
+迭代版本
+```javascript
+var sumOfLeftLeaves = function(root) {
+   //采用层序遍历
+   if(root===null){
+       return null;
+   }
+   let queue = [];
+   let sum = 0;
+   queue.push(root);
+   while(queue.length){
+     let node = queue.shift();
+     if(node.left!==null&&node.left.left===null&&node.left.right===null){
+         sum+=node.left.val;
+     }
+     node.left&&queue.push(node.left);
+     node.right&&queue.push(node.right);
+   }
+   return sum;
+};
+```