-
-
Notifications
You must be signed in to change notification settings - Fork 298
/
Copy path110.py
79 lines (58 loc) · 2.12 KB
/
110.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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
__________________________________________________________________________________________________
sample 40 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 isBalanced(self, root: TreeNode) -> bool:
def isBalanced_root(node):
if not node:
return -1
left = isBalanced_root(node.left)
if left != -2:
right = isBalanced_root(node.right)
if left == -2 or right == -2 or abs(left-right) > 1:
return -2
return 1 + max(left, right)
return isBalanced_root(root) != -2
__________________________________________________________________________________________________
sample 17720 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 caldepth(self,root):
if root is None:
return 0
left = self.caldepth(root.left)
right = self.caldepth(root.right)
if abs(left-right)>1:
self.flag = True
return max(left, right)+1
def dohelp(self,root):
leftdepth = self.caldepth(root.left)
rightdepth = self.caldepth(root.right)
if abs(leftdepth-rightdepth)>1:
return False
else:
return True
def isBalanced(self, root: TreeNode) -> bool:
if root is None:
return True
self.flag = False
if self.dohelp(root) is False:
return False
ret = self.isBalanced(root.left)
if ret is False:
return False
ret = self.isBalanced(root.right)
if ret is False:
return False
return True
__________________________________________________________________________________________________