1302. 层数最深叶子节点的和

算法记录

LeetCode 题目：

  给你一棵二叉树的根节点 root ，请你返回 层数最深的叶子节点的和 。

---

---

说明

一、题目

  输入：root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
  输出：15

二、分析

• 进行递归遍历时只需要维护一个最深的层次数和当前层数的节点值和就可以了。

/**
 * 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 {
    private int max;
    private int deep;
    public int deepestLeavesSum(TreeNode root) {
        max = 0;
        deep = 0;
        find(root, 0);
        return max;
    }
    public void find(TreeNode root, int deepNum) {
        if(root == null) return ;
        if(deepNum == deep) max += root.val;
        if(deepNum > deep) {
            deep = deepNum;
            max = root.val;
        }
        find(root.left, deepNum + 1);
        find(root.right, deepNum + 1);
    }
}

---

总结

熟悉二叉树的深度遍历和层次的记录。