每日一题:563. 二叉树的坡度

解题思路

深度优先搜索即可

代码

/**
 * 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 ans = 0;
        public int findTilt(TreeNode root) {
            if (root!=null){
                dfs(root);
            }
            return ans;
        }
        public int dfs(TreeNode node){
            int left = 0;
            if (node.left!=null){
                left += dfs(node.left);
            }
            int right = 0;
            if (node.right!=null){
                right += dfs(node.right);
            }
            ans+=Math.abs(left-right);
        //关键在于这个node.val
            return left+right+node.val;
        }
}