1302.层数最深叶子节点的和
-
链接
leetcode
-
solution:
BFS 每一层都算一下res 最后res的就是需要返回的值
-
code
class Solution {
public:
int deepestLeavesSum(TreeNode* root) {
int res=0;
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
int len=q.size();
res=0;
while(len--){
TreeNode* t=q.front();
q.pop();
res+=t->val;
if(t->left) q.push(t->left);
if(t->right) q.push(t->right);
}
}
return res;
}
};