程式語言 - LeetCode - C++ - 1161. Maximum Level Sum of a Binary Tree

參考資訊：
https://www.cnblogs.com/grandyang/p/15022629.html

題目：


解答：

/**
 * 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 r = 0;
        int m = 0;
        int level = 0;
        queue<TreeNode *> q;

        if (!root) {
            return 0;
        }

        q.push(root);
        m = root->val;

        while (q.size() > 0) {
            int sum = 0;
            int len = q.size();

            for (int i = 0; i < len; i++) {
                TreeNode *t = q.front();

                q.pop();
                sum += t->val;
                if (t->left) {
                    q.push(t->left);
                }

                if (t->right) {
                    q.push(t->right);
                }
            }

            if (sum > m) {
                r = level;
                m = sum;
            }
            level += 1;
        }

        return r + 1;
    }
};