leetcode 515. 在每个树行中找最大值

2023.6.29

         层序遍历变体，不多说直接上代码：

class Solution {
public:
    vector<int> largestValues(TreeNode* root) {
        vector<int> ans;
        queue<TreeNode*> que;
        if(root == nullptr) return {};
        que.push(root);
        while(!que.empty())
        {
            int size = que.size();
            int max = INT_MIN;
            while(size--)
            {
                TreeNode* node = que.front();
                que.pop();
                if(node->val > max) max = node->val;
                if(node->left) que.push(node->left);
                if(node->right) que.push(node->right);
            }
            ans.push_back(max);
        }
        return ans;
    }
};