【算法专题十二】队列+宽搜

1.leetcode.429.N叉树的层序遍历

1.题目

题目链接

2.思路

3.代码

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val) {
        val = _val;
    }

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
public:
    vector<vector<int>> levelOrder(Node* root) {
        vector<vector<int>> ret; // 记录最终结果
        queue<Node*> q; // 层序遍历需要的队列
        if(root == nullptr) return ret;
        q.push(root);
        while(q.size())
        {
            int k = q.size();
            vector<int> tmp; // 记录每一层的节点
            for(int i = 0; i < k; i++)
            {
                Node* t = q.front();
                q.pop();
                tmp.push_back(t->val);
                for(auto& c : t->children)
                {
                    q.push(c);
                }
            }
            ret.push_back(tmp);
        }
        return ret;
    }
};

2. leetcode.103.二叉树的锯齿形层序遍历

2.1 题目

题目链接

2.2 思路

2.3 代码

/**
 * 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<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<vector<int>> ret;
        if(root == nullptr) return ret;
        int i = 1;// 判断是否取反的标志位
        queue<TreeNode*> q;
        q.push(root);
        while(q.size())
        {
            int k = q.size();
            vector<int> tmp;
            for(int i = 0; i < k; i++)
            {
                auto t = q.front();
                q.pop();
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
                tmp.push_back(t->val);
            }
            if(i % 2 == 0) //判断是否取反
            {
                reverse(tmp.begin(), tmp.end());
            }
            i++;
            ret.push_back(tmp);
        }
        return ret;
    }
};

3.leetcode.二叉树的最大宽度

3.1 题目

题目链接

3.2 思路

3.3 代码

/**
 * 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:
    int widthOfBinaryTree(TreeNode* root) {
        vector<pair<TreeNode*, unsigned int>> q;
        q.push_back({root, 1});
        unsigned ret = 0;
        while(q.size())
        {
            // 先更新这一层的宽度
            auto& [x1, y1] = q[0];
            auto& [x2, y2] = q.back();
            ret = max(ret, y2 - y1 + 1);
            
            // 让下一层进队
            vector<pair<TreeNode*, unsigned int>> tmp;
            for(auto & [x, y] : q)
            {
                if(x->left) tmp.push_back({x->left, y * 2});
                if(x->right) tmp.push_back({x->right, y * 2 + 1});
            }
            q = tmp;
        }
        return ret;
    }
};

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

4.1 题目

4.2 思路

4.3

/**
 * 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> ret;
        if(root == nullptr) return ret;
        queue<TreeNode*> q;
        q.push(root);
        while(q.size())
        {
            int sz = q.size();
            int tmp = INT_MIN;
            for(int i = 0; i < sz; i++)
            {
                TreeNode* t = q.front();
                q.pop();
                tmp = max(tmp, t->val);
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
            }
            ret.push_back(tmp);
        }
        return ret;
    }
};