Leetcode 979. Distribute Coins in Binary Tree
题目链接: Distribute Coins in Binary Tree
难度:Medium
题目大意:
二叉树有n个节点,每个节点上的值表示该节点上有几个硬币,整棵二叉树共有n个硬币,求需要经过多少次移动使得每个节点上都是一个硬币。
思路:
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int res=0;
public int distributeCoins(TreeNode root) {
dfs(root);
return res;
}
public int dfs(TreeNode root){
//返回节点root的过载量,如果root.val=4,则过载量为4-1=3,
//即要向父亲节点提供3枚硬币
//如果root.val=0,则过载量为0-1=-1
if(root==null){
return 0;
}
int left=dfs(root.left);
int right=dfs(root.right);
res=res+Math.abs(left)+Math.abs(right);
return root.val-1+left+right;//root.val-1是因为root最后要保留一枚硬币
}
}