题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int res=0;
void bfs(TreeNode*root){
queue<TreeNode*> q;
q.push(root);
while(q.size()){
int len=q.size();
res=0;
for(int i=1;i<=len;i++)
{
TreeNode*p=q.front();
q.pop();
res+=p->val;
if(p->left!=nullptr) q.push(p->left);
if(p->right!=nullptr) q.push(p->right);
}
}
}
int deepestLeavesSum(TreeNode* root) {
bfs(root);
return res;
}
};