Package g0901_1000.s0979_distribute_coins_in_binary_tree

Class Solution

java.lang.Object
g0901_1000.s0979_distribute_coins_in_binary_tree.Solution
public class Solution extends Object
979 - Distribute Coins in Binary Tree.<p>Medium</p> <p>You are given the <code>root</code> of a binary tree with <code>n</code> nodes where each <code>node</code> in the tree has <code>node.val</code> coins. There are <code>n</code> coins in total throughout the whole tree.</p> <p>In one move, we may choose two adjacent nodes and move one coin from one node to another. A move may be from parent to child, or from child to parent.</p> <p>Return <em>the <strong>minimum</strong> number of moves required to make every node have <strong>exactly</strong> one coin</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/01/18/tree1.png" alt="" /></p> <p><strong>Input:</strong> root = [3,0,0]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> From the root of the tree, we move one coin to its left child, and one coin to its right child.</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/01/18/tree2.png" alt="" /></p> <p><strong>Input:</strong> root = [0,3,0]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is <code>n</code>.</li> <li><code>1 <= n <= 100</code></li> <li><code>0 <= Node.val <= n</code></li> <li>The sum of all <code>Node.val</code> is <code>n</code>.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • distributeCoins

      public int distributeCoins(TreeNode root)