LeetCode 979. Distribute Coins in Binary Tree

原题链接在这里：https://leetcode.com/problems/distribute-coins-in-binary-tree/

题目：

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

题解：

Count how many coins current node could give back to its parent.

It could be positive, means having extra coins. Or negative, means needing support from parent. This is the move number, add the absolute value back to result.

The current node, get the count from left child, and count from right right. current node's value plus counts from both left child and right child - 1 is the count that how many coins it could give back to its parent.

Time Complexity: O(n).

Space: O(h).

AC Java:

 /**
  * Definition for a binary tree node.
  * public class TreeNode {
  *     int val;
  *     TreeNode left;
  *     TreeNode right;
  *     TreeNode(int x) { val = x; }
  * }
  */
 class Solution {
     int res = 0;
 
     public int distributeCoins(TreeNode root) {
         if(root == null){
             return 0;
         }
 
         sendCount(root);
         return res;
     }
 
     private int sendCount(TreeNode root){
         if(root == null){
             return 0;
         }
 
         int left = sendCount(root.left);
         int right = sendCount(root.right);
 
         int count = root.val + left + right - 1;
         res += Math.abs(count);
         return count;
     }
 }