From d131731015f2184cb4ffb428bf414e258225fd61 Mon Sep 17 00:00:00 2001
From: Asterisk <44215173+casnz1601@users.noreply.github.com>
Date: Fri, 8 Oct 2021 13:15:58 +0800
Subject: [PATCH] =?UTF-8?q?Update=200404.=E5=B7=A6=E5=8F=B6=E5=AD=90?=
 =?UTF-8?q?=E4=B9=8B=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

勘误python注释
---
 problems/0404.左叶子之和.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/0404.左叶子之和.md b/problems/0404.左叶子之和.md
index fb574794..ffcd2c8c 100644
--- a/problems/0404.左叶子之和.md
+++ b/problems/0404.左叶子之和.md
@@ -42,7 +42,7 @@ if (node->left != NULL && node->left->left == NULL && node->left->right == NULL)
 
 ## 递归法
 
-递归的遍历顺序为后序遍历（左右中），是因为要通过递归函数的返回值来累加求取左叶子数值之和。（前序遍历其实也同样AC）
+递归的遍历顺序为后序遍历（左右中），是因为要通过递归函数的返回值来累加求取左叶子数值之和。。
 
 递归三部曲：
 
@@ -230,7 +230,7 @@ class Solution {
 
 ## Python 
 
-> 递归后序遍历
+**递归后序遍历**
 ```python3
 class Solution:
     def sumOfLeftLeaves(self, root: TreeNode) -> int:
@@ -247,7 +247,7 @@ class Solution:
         return cur_left_leaf_val + left_left_leaves_sum + right_left_leaves_sum # 中
 ```
 
-> 迭代
+**迭代**
 ```python3
 class Solution:
     def sumOfLeftLeaves(self, root: TreeNode) -> int: