979. Distribute Coins in Binary Tree [Medium]

979. Distribute Coins in Binary Tree [Medium]
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<= N <= 100
0 <= node.val <= N

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

---

算法思路：

见代码注释，分而治之的思想

class Solution {
public:
    int distributeCoins(TreeNode* root) {
        int res = 0;
        countMoves(root, res);
        return res;
    }
private:
    int countMoves(TreeNode* node, int& res) {
        if (node == nullptr) return 0;
        // 分别记录当前节点的左子树和右子树可以额外提供的coins
        int leftExtraCoins = countMoves(node->left, res); 
        int rightExtraCoins = countMoves(node->right, res);
        // 那么到达该节点的移动数就是绝对值之后的和
        res += abs(leftExtraCoins) + abs(rightExtraCoins);
        // 对外提供的额外coins是左右节点提供的coins的和加上该节点coins - 1
        return leftExtraCoins + rightExtraCoins + node->val - 1;
    }
};