-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
530.py
47 lines (44 loc) · 1.46 KB
/
530.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
__________________________________________________________________________________________________
sample 48 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 getMinimumDifference(self, root: TreeNode) -> int:
res = []
self.dfs(root,res)
result = []
for i in range(1,len(res)):
result.append(abs(res[i]-res[i-1]))
return min(result)
def dfs(self, root, res):
if not root:
return []
else:
if root.left:
self.dfs(root.left, res)
res.append(root.val)
if root.right:
self.dfs(root.right, res)
return res
__________________________________________________________________________________________________
sample 15308 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 getMinimumDifference(self, root):
L = []
def dfs(node):
if node.left: dfs(node.left)
L.append(node.val)
if node.right: dfs(node.right)
dfs(root)
return min(abs(a - b) for a, b in zip(L, L[1:]))
__________________________________________________________________________________________________