-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
979.py
66 lines (57 loc) · 1.81 KB
/
979.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
__________________________________________________________________________________________________
sample 28 ms submission
#
# @lc app=leetcode id=979 lang=python3
#
# [979] Distribute Coins in Binary Tree
#
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def distributeCoins(self, root: TreeNode) -> int:
self.res = 0
def dfs(node):
if not node:
return
if node.left:
dfs(node.left)
node.val += node.left.val - 1
if node.right:
dfs(node.right)
node.val += node.right.val - 1
self.res += abs(node.val - 1)
dfs(root)
return self.res
__________________________________________________________________________________________________
sample 12952 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 __init__(self):
self.count = 0
def distributeCoins(self, root: TreeNode) -> int:
self.helper(root)
return self.count
def helper(self, root):
if not root:
return 0
childRequire = self.helper(root.left) + self.helper(root.right)
if root.val == childRequire + 1:
return 0
elif root.val < childRequire+1:
thisRequire = childRequire+1 - root.val
self.count += thisRequire
return thisRequire
elif root.val > childRequire+1:
thisGive = root.val - (childRequire+1)
self.count += thisGive
return -thisGive
__________________________________________________________________________________________________