[leetcode] 979. Distribute Coins in Binary Tree

Description

Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.

In one move, we may choose two adjacent nodes and move one coin from one node to another. (The move may be from parent to child, or from child to parent.)

Return the number of moves required to make every node have exactly one coin.

Example 1:

Input: [3,0,0]
Output: 2
Explanation: From the root of the tree, we move one coin to its left child, and one coin to its right child.

Example 2:

Input: [0,3,0]
Output: 3
Explanation: From the left child of the root, we move two coins to the root [taking two moves].  Then, we move one coin from the root of the tree to the right child.

Example 3:

Input: [1,0,2]
Output: 2

Example 4:

Input: [1,0,0,null,3]
Output: 4

Note:

1. 1<= N <= 100
2. 0 <= node.val <= N

分析

题目的意思是：给定一个二叉树，节点的值代表硬币的个数，现在要把硬币平均分配到各个节点，求硬币移动的次数。这道题我没有做出来，参考了一下别人的思路。

abs(dfs(node.left)) + abs(dfs(node.right))

表示需要移动的硬币的步数

node.val + dfs(node.left) + dfs(node.right) - 1 

表示当前节点额外的硬币数
如果能够想到这个就好办了，递归就出来结果了，但是思路不一定能够想到哈哈哈，特别是上面这迷之公式需要找规律

代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def solve(self,root):
        if(root is None):
            return 0
        l=self.solve(root.left)
        r=self.solve(root.right)
        self.res+=abs(l)+abs(r)
        return root.val+l+r-1
    def distributeCoins(self, root: TreeNode) -> int:
        self.res=0
        self.solve(root)
        return self.res

参考文献

[LeetCode] solution