LeetCode 515. Find Largest Value in Each Tree Row

pursuit_csdn

于 2024-12-25 14:50:37 发布

阅读量219

点赞数 1

分类专栏： LeetCode Daily Question 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_42383726/article/details/144719735

版权

LeetCode Daily Question 专栏收录该内容

65 篇文章

订阅专栏

🔗 https://leetcode.com/problems/find-largest-value-in-each-tree-row

题目

返回二叉树每层的最大值

思路

队列 bfs 遍历，按照层遍历

代码

/**
 * 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:
    vector<int> largestValues(TreeNode* root) {
        vector<int> ans;
        if (root == nullptr) return ans;
        queue<TreeNode*> que;
        que.push(root);
        while (!que.empty()) {
            int size = que.size();
            int num = que.front()->val;
            while (size--) {
                auto* node = que.front();
                num = max(num, node->val); que.pop();
                if (node->left) que.push(node->left);
                if (node->right) que.push(node->right);
            }
            ans.push_back(num);
        }
        return ans;
        
    }
};