leetcode 515. Find Largest Value in Each Tree Row 二叉树每一层最大值+广度优先遍历BFS

最新推荐文章于 2022-08-08 09:50:16 发布

原创最新推荐文章于 2022-08-08 09:50:16 发布 · 261 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode For C++ 同时被 3 个专栏收录

551 篇文章

订阅专栏

leetcode For Java

502 篇文章

订阅专栏

DFS深度优先搜索

171 篇文章

订阅专栏

本文介绍了一种算法，通过广度优先搜索(BFS)找出二叉树每一层的最大值，并提供了完整的C++实现代码。

You need to find the largest value in each row of a binary tree.

Example:
Input:

Output: [1, 3, 9]

本题题意很简单，就是做一个BFS广度优先遍历，

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>

using namespace std;


/*
struct TreeNode 
{
     int val;
     TreeNode *left;
     TreeNode *right;
     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
*/

class Solution
{
public:
    vector<int> largestValues(TreeNode* root)
    {
        vector<int> res;
        if (root == NULL)
            return res;

        queue<TreeNode*> que;
        que.push(root);
        while (que.empty() == false)
        {
            int size = que.size();
            int maxNum = que.front()->val;
            for (int i = 0; i < size; i++)
            {
                TreeNode* one = que.front();
                maxNum = max(maxNum, one->val);
                que.pop();
                if (one->left != NULL)
                    que.push(one->left);
                if (one->right != NULL)
                    que.push(one->right);
            }
            res.push_back(maxNum);
        }
        return res;
    }
};