-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode_199.py
More file actions
58 lines (48 loc) · 1.28 KB
/
leetcode_199.py
File metadata and controls
58 lines (48 loc) · 1.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
# coding=utf-8
from typing import List
from src.data_structure.data_structure import TreeNode
class Solution:
"""
二叉树的右视图
"""
def right_side_view(self, root: TreeNode) -> List[int]:
"""
Time: O(n), Space: O(n)
:param root:
:return:
"""
if not root:
return []
ret, queue = [], [root]
while len(queue) > 0:
ret.append(queue[0].val)
size = len(queue)
for i in range(size):
node = queue.pop(0)
if node.right:
queue.append(node.right)
if node.left:
queue.append(node.left)
return ret
def dfs(self, root: TreeNode, ret: List[int], level: int):
"""
:param root:
:param ret:
:param level:
:return:
"""
if not root:
return
if level == len(ret):
ret.append(root.val)
self.dfs(root.right, ret, level + 1)
self.dfs(root.left, ret, level + 1)
def right_side_view2(self, root: TreeNode) -> List[int]:
"""
Time: O(n), Space: O(n)
:param root:
:return:
"""
ret = []
self.dfs(root, ret, 0)
return ret