4.23力扣刷题记录

1.二叉树的宽度

二叉树的宽度
solution:层序遍历+存储结点在当前层的位置

/**
 * 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) {
        if(root==NULL)
            return 0;
        queue<pair<TreeNode*, long long>> queue;
        int maxlength=0;
        queue.emplace(root,0);
        while(!queue.empty()){
            int n=queue.size();
            int l,r;
            for(int i=0;i<n;i++){
                auto temp=queue.front();
                queue.pop();
                if(i==0)
                    l=temp.second;
                if(i==n-1)
                    r=temp.second;
                if(temp.first->left)
                    queue.emplace(temp.first->left, temp.second*2+1-l*2-1);
                if(temp.first->right)
                    queue.emplace(temp.first->right, temp.second*2+2-l*2-1);
            }
            maxlength=max(maxlength,r-l+1);
        }
        return maxlength;
    }
};