题目:
![](https://img-blog.csdnimg.cn/direct/7a4eab3eadb04b5f87f9c3c11d09ae79.png)
代码(首刷自解 2024年1月24日):
class Solution {
public:
vector<int> largestValues(TreeNode* root) {
vector<int> res = {};
if(root == nullptr) return res;
queue<TreeNode*> que;
TreeNode* cur = root;
que.push(cur);
int size = 0;
while (!que.empty()) {
size = que.size();
int max_value = que.front()->val;
while (size--) {
TreeNode* node = que.front();
max_value = max(max_value,node->val);
que.pop();
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
res.emplace_back(max_value);
}
return res;
}
};