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

最新推荐文章于 2024-07-13 19:27:27 发布

nuita

最新推荐文章于 2024-07-13 19:27:27 发布

阅读量67

点赞数

文章标签： c++ 算法 leetcode

本文链接：https://blog.csdn.net/qq_25155231/article/details/127447016

版权

class Solution {
public:
    vector<int> largestValues(TreeNode* root) {
        vector<int>ans;
        int m,size = 1,i = 0;
        TreeNode* t;
        queue<TreeNode*>q;
        if (root)q.push(root), m = root->val;
        while (!q.empty()) {
            t = q.front();
            if (t->val > m)m = t->val;
            q.pop(); i++;
            if (t->left)q.push(t->left);
            if (t->right)q.push(t->right);
            if (i == size) {
                size = q.size(), ans.push_back(m), i = 0;
                if (!q.empty())m = q.front()->val;
            }
        }
        return ans;
    }
};