DFS -LeetCode-563. 二叉树的坡度

563. 二叉树的坡度

DFS

思路

• 使用 getSumTreeNode root 求解以 root 为根节点子树所有节点之和
  • 返回值： 以 root 为根节点子树所有节点之和
  • 用 res 收集每一个 root 左、右子树节点和差的绝对值（即，节点 root 的坡度）之和（求和为整棵树的坡度）

/**
 * 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 findTilt(TreeNode root) {
        getSum(root);
        return res;
    }

    int getSum(TreeNode root) {
        if (root == null) return 0;
        int left = getSum(root.left);
        int right = getSum(root.right);
        res += Math.abs(left - right);
        return left + right + root.val;
    }
}

记忆化搜

可以使用 map 保存已经求得 “坡度” 结果的子树

/**
 * 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;
    Map<TreeNode, Integer> cache = new HashMap<>();
   
    public int findTilt(TreeNode root) {
        getSum(root);
        return res;
    }

    int getSum(TreeNode root) {
        if (root == null) return 0;
        if (cache.containsKey(root)) { // 访问记忆
            return cache.get(root);
        }
        int left = getSum(root.left);
        int right = getSum(root.right);
        res += Math.abs(left - right);
        int sum = left + right + root.val;
        // 保存记忆
        cache.put(root, sum);
        return sum;
    }
}