Maximum Width of Binary Tree

最新推荐文章于 2022-02-20 23:27:58 发布

673556617-real

最新推荐文章于 2022-02-20 23:27:58 发布

阅读量325

点赞数

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/awawfwfw/article/details/77919874

版权

算法同时被 2 个专栏收录

243 篇文章 0 订阅

订阅专栏

leetcode

225 篇文章 0 订阅

订阅专栏

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.

实现的思路是用两个hashmap保存当前层的index， minMap保存当前层最左边的节点的index， maxMap则保存最后边的节点的index。 minMap每一层只需要存储一次，（第一次）, maxMap 则需要不断的更新，因为不确定当前的点是否是最右侧的。最后统计一下每一层的最大值。如果不存在最大或者最小值，那么就跳过这一层。

代码：

    public int widthOfBinaryTree(TreeNode root) {
        if(root == null) return 0;

        HashMap<Integer, Integer> minMap = new HashMap<>();
        HashMap<Integer, Integer> maxMap = new HashMap<>();
        dfs(minMap, maxMap, root, 0, 0);
        int max = Integer.MIN_VALUE;
        for(int i=0;i<maxMap.size();i++) {
            if(!maxMap.containsKey(i) || !minMap.containsKey(i)) continue;
            max = Math.max(max, maxMap.get(i) - minMap.get(i));

        }
        return max;
    }

    private void dfs(HashMap<Integer, Integer> minMap,
                     HashMap<Integer, Integer> maxMap,
                     TreeNode node,
                     int layer, int index) {
        if(node == null) return;
        if(!minMap.containsKey(layer)) minMap.put(layer, index);
        if(!maxMap.containsKey(layer)
                || maxMap.get(layer)<index) {
            maxMap.put(layer, index);
        }

        if(node.left != null) {
            dfs(minMap, maxMap, node.left, layer+1, index*2);

        }
        if(node.right != null) {
            dfs(minMap, maxMap, node.right, layer+1, index*2+1);

        }
    }