learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update 0404.左叶子之和.md 

勘误python注释
This commit is contained in:
Asterisk 2021-10-08 13:15:58 +08:00 committed by GitHub
parent 5e5b3d5f4c
commit d131731015
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0404.左叶子之和.md
View File

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