Leetcode 题解系列（十七）

最新推荐文章于 2024-07-21 15:36:00 发布

hsu_chan

最新推荐文章于 2024-07-21 15:36:00 发布

阅读量132

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/hsu_chan/article/details/79080822

版权

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

662. Maximum Width of Binary Tree

题目内容

Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tree, but some nodes are null.

The width of one level is defined as the length between the end-nodes (the leftmost and right most non-null nodes in the level, where the null nodes between the end-nodes are also counted into the length calculation.

Example 1:

Input: 

           1
         /   \
        3     2
       / \     \  
      5   3     9 

Output: 4
Explanation: The maximum width existing in the third level with the length 4 (5,3,null,9).

Example 2:

Input: 

          1
         /  
        3    
       / \       
      5   3     

Output: 2
Explanation: The maximum width existing in the third level with the length 2 (5,3).

Example 3:

Input: 

          1
         / \
        3   2 
       /        
      5      

Output: 2
Explanation: The maximum width existing in the second level with the length 2 (3,2).

Example 4:

Input: 

          1
         / \
        3   2
       /     \  
      5       9 
     /         \
    6           7
Output: 8
Explanation:The maximum width existing in the fourth level with the length 8 (6,null,null,null,null,null,null,7).

Note: Answer will in the range of 32-bit signed integer.

思考

假设二叉树的节点有属性width和depth，分别代表节点在树中的横向位置和纵向深度（均从1开始），那么有

L e f t w i d t h = P a r e n t w i d t h * 2 - 1 R i g h t w i d t h = P a r e n t w i d t h * 2 L e f t d e p t h = R i g h t d e p t h = P a r e n t d e p t h + 1

$Left_{width} = Parent_{width} * 2 - 1\\ Right_{width} = Parent_{width} * 2 \\ Left_{depth} = Right_{depth} = Parent_{depth} + 1$
这些性质也可以用在计算二叉树节点在数组中存储时的偏移值。
进行dfs的时候，保存每一层的最大和最小width，最后就可以计算出最大的宽度。

代码

class Solution {
    unordered_map<int, int> max_width, min_width;
public:
    int widthOfBinaryTree(TreeNode* root) {
        max_width.clear();
        min_width.clear();
        dfs(root, 1, 1);
        int ret = 0;
        for (const auto &kp : max_width) {
            ret = std::max(ret, kp.second - min_width[kp.first]);
        }
        return ret + 1;
    }
    void dfs(TreeNode* node, int width, int depth) {
        if (node == NULL) return;
        if (min_width.find(depth) == min_width.end()) min_width[depth] = INT_MAX;
        dfs(node->right, width * 2, depth + 1);
        dfs(node->left, width * 2 - 1, depth + 1);
        if (max_width.find(depth) == max_width.end()) max_width[depth] = width;
        if (min_width[depth] > width) min_width[depth] = width;
    }
};