LeetCode刷题笔记：1302.层数最深叶子节点的和

1. 问题描述

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

2. 解题思路

层序遍历
维护一个全局变量 sum
进入每层循环时，先将该层的和 sum 置为 0

3. 实现代码

/**
 * 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 {
    public int deepestLeavesSum(TreeNode root) {
        int sum = 0;
        Deque<TreeNode> q = new LinkedList<>();
        q.offer(root);
        while(!q.isEmpty()) {
            int len = q.size();
            sum = 0;
            for (int i = 0; i < len; i++) {
                TreeNode temp = q.poll();
                sum += temp.val;
                if (temp.left != null) {
                    q.offer(temp.left);
                }
                if (temp.right != null) {
                    q.offer(temp.right);
                }
            }
        }
        return sum;
    }
}