1161. 最大层内元素和

原题链接：1161. 最大层内元素和

 

solution:
        

/**
 * 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) {
        if(root == nullptr) return 0;
        queue<TreeNode*> que;
        que.push(root);
        int i = 1;
        int res = 0;
        int maxs = INT_MIN;
        while(!que.empty()) {
            int size = que.size();
            int sum = 0;
            while(size--) {
                auto t = que.front();
                que.pop();
                sum += t->val;
                if(t->left) que.push(t->left);
                if(t->right) que.push(t->right);
            }
            if(sum > maxs) {
                maxs = sum;
                res = i;
            }
            i++;
        }
        return res;
    }
};