563. Binary Tree Tilt(二叉树的坡度)

题目描述

在这里插入图片描述

方法思路

public class Solution {
    //真是个莫名其妙的的题目
    //Runtime: 3 ms, faster than 100.00% 
    //Memory Usage: 40.8 MB, less than 10.53%
    int tilt=0;
    public int findTilt(TreeNode root) {
        traverse(root);
        return tilt;
    }
    public int traverse(TreeNode root)
    {
        if(root==null )
            return 0;
        int left=traverse(root.left);
        int right=traverse(root.right);
        tilt+=Math.abs(left-right);
        return left+right+root.val;
    }
}

猜你喜欢

转载自blog.csdn.net/IPOC_BUPT/article/details/88565455