首页 > TAG信息列表 > leetcode1302
leetcode1302-层数最深叶子节点的和
层数最深叶子节点的和 BFS 层序遍历树，返回最后一次计算的结果 class Solution { public int deepestLeavesSum(TreeNode root) { List<TreeNode> list = new ArrayList<>(); int start = 0, end = 1, last = 1, cnt = 0; list.add(root); wleetcode1302-层数最深叶子节点的和
层数最深叶子节点的和 BFS 层序遍历树，返回最后一次计算的结果 class Solution { public int deepestLeavesSum(TreeNode root) { List<TreeNode> list = new ArrayList<>(); int start = 0, end = 1, last = 1, cnt = 0; list.add(root); w