-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
104.py
43 lines (37 loc) · 1.31 KB
/
104.py
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
__________________________________________________________________________________________________
sample 32 ms submission
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def maxDepth(self, root: TreeNode) -> int:
def helper(node, level):
if not node:
return level
return max(helper(node.left, level+1), helper(node.right, level+1))
depth = helper(root, 0)
return depth
__________________________________________________________________________________________________
sample 14288 kb submission
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def maxDepth(self, root: TreeNode) -> int:
if root is None:
return 0
d=1
queue=[(d,root)]
while queue:
d,node=queue.pop(0)
if node:
queue.append((d+1,node.left))
queue.append((d+1,node.right))
return d-1
__________________________________________________________________________________________________