algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 11:34:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

Revert "更新 513.找树左下角的值 python 部分代码"

Browse Source 
This reverts commit 2f412e5c7d3b41b66946d92e699330cb7e5e5036.
This commit is contained in:
Kelvin
2021-07-29 11:21:14 -04:00
parent 2f412e5c7d
commit 8c53c48ea8
1 changed files with 12 additions and 49 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
problems/0513.找树左下角的值.md
View File

@ -274,9 +274,8 @@ class Solution {
Python： Python：
**递归法 - 回溯**
```python ```python
//递归法
# Definition for a binary tree node. # Definition for a binary tree node.
# class TreeNode: # class TreeNode:
# def __init__(self, val=0, left=None, right=None): # def __init__(self, val=0, left=None, right=None):
@ -285,53 +284,17 @@ Python：
# self.right = right # self.right = right
class Solution: class Solution:
def findBottomLeftValue(self, root: TreeNode) -> int: def findBottomLeftValue(self, root: TreeNode) -> int:
max_depth = -float("INF") depth=0
max_left_value = -float("INF") self.res=[]
def level(root,depth):
def __traversal(root, left_len): if not root:return
nonlocal max_depth, max_left_value if depth==len(self.res):
self.res.append([])
if not root.left and not root.right: self.res[depth].append(root.val)
if left_len > max_depth: level(root.left,depth+1)
max_depth = left_len level(root.right,depth+1)
max_left_value = root.val level(root,depth)
return return self.res[-1][0]
if root.left:
left_len += 1
__traversal(root.left, left_len)
left_len -= 1
if root.right:
left_len += 1
__traversal(root.right, left_len)
left_len -= 1
return
__traversal(root, 0)
return max_left_value
```
**迭代法 - 层序遍历**
```python
class Solution:
def findBottomLeftValue(self, root: TreeNode) -> int:
queue = deque()
if root:
queue.append(root)
result = 0
while queue:
q_len = len(queue)
for i in range(q_len):
if i == 0:
result = queue[i].val
cur = queue.popleft()
if cur.left:
queue.append(cur.left)
if cur.right:
queue.append(cur.right)
return result
``` ```
Go： Go：