Leetcode 1302. Deepest Leaves Sum
题目链接: Deepest Leaves Sum
难度:Medium
题目大意:
求二叉树最深叶子结点的和,即最后一层所有叶子节点之和。
思路:
思路1 :
利用二叉树的层级遍历,计算出每一层节点的和,最后一层节点的和就是最深叶子节点的和。
思路2(递归):
参考高赞回答 ,递归,用level来标记当前的层数,详见代码。
代码
思路1代码
/**
* 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) {
Queue<TreeNode> queue=new LinkedList<>();
int sum=0;
if(root!=null){
queue.offer(root);
while(!queue.isEmpty()){
int n=queue.size();
sum=0;//sum是每一层的节点值的和,最后一次求的值即题目所求答案。
for(int i=0;i<n;i++){
TreeNode node=queue.poll();
sum+=node.val;
if(node.left!=null){
queue.offer(node.left);
}
if(node.right!=null){
queue.offer(node.right);
}
}
}
}
return sum;
}
}
思路2代码
/**
* 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 sum=0,maxLevel=0;
public int deepestLeavesSum(TreeNode root) {
helper(root,0);
return sum;
}
public void helper(TreeNode root,int level){
if(root==null){
return;
}
if(level>maxLevel){
sum=0;
maxLevel=level;
}
if(level==maxLevel){
sum+=root.val;
}
helper(root.left,level+1);
helper(root.right,level+1);
}
}