层序遍历的应用。
#include <queue>
/**
* 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 maxLevelSum(TreeNode* root) {
int res = 1;
int curr = root->val;
int layer = 0;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
int size = q.size();
int tmp = 0;
for (int i = 0; i < size; i++) {
TreeNode* tmp_root = q.front();
q.pop();
tmp += tmp_root->val;
if (tmp_root->left) q.push(tmp_root->left);
if (tmp_root->right) q.push(tmp_root->right);
}
layer++;
if (tmp > curr) {
curr = tmp;
res = layer;
}
}
return res;
}
};