mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 04:54:51 +08:00
Update 0513.找树左下角的值.md
This commit is contained in:
@ -330,19 +330,24 @@ class Solution:
|
|||||||
# self.right = right
|
# self.right = right
|
||||||
from collections import deque
|
from collections import deque
|
||||||
class Solution:
|
class Solution:
|
||||||
def findBottomLeftValue(self, root: Optional[TreeNode]) -> int:
|
def findBottomLeftValue(self, root):
|
||||||
queue = deque([root])
|
if root is None:
|
||||||
|
return 0
|
||||||
|
queue = deque()
|
||||||
|
queue.append(root)
|
||||||
|
result = 0
|
||||||
while queue:
|
while queue:
|
||||||
size = len(queue)
|
size = len(queue)
|
||||||
leftmost = queue[0].val
|
|
||||||
for i in range(size):
|
for i in range(size):
|
||||||
node = queue.popleft()
|
node = queue.popleft()
|
||||||
|
if i == 0:
|
||||||
|
result = node.val
|
||||||
if node.left:
|
if node.left:
|
||||||
queue.append(node.left)
|
queue.append(node.left)
|
||||||
if node.right:
|
if node.right:
|
||||||
queue.append(node.right)
|
queue.append(node.right)
|
||||||
if not queue:
|
return result
|
||||||
return leftmost
|
|
||||||
|
|
||||||
|
|
||||||
```
|
```
|
||||||
|
Reference in New Issue
Block a user