515. 在每个树行中找最大值
给定一棵二叉树的根节点 root ,请找出该二叉树中每一层的最大值。
示例1:
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
示例2:
输入: root = [1,2,3]
输出: [1,3]
提示:
二叉树的节点个数的范围是 [0,104]
-2 31 <= Node.val <= 2 31 - 1
代码
/**
* 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) {
queue<TreeNode*> que;
if (root != NULL) {
que.push(root);
}
vector<int> res;
while (!que.empty()) {
int size = que.size();
int maxx = -2147483648;//有一个数据卡int的最小值....
for (int i = 0; i < size; i++) {
TreeNode* node = que.front();
que.pop();
maxx = max(maxx, node->val);//逐个比较,维护最大值
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
res.push_back(maxx);//最大值存入数组
}
return res;
}
};