LeetCode-1161. Maximum Level Sum of a Binary Tree

LeetCode-1161. Maximum Level Sum of a Binary Tree

• 原题链接：https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/

解题思路

• 其实就是二叉树的层次遍历的变种而已，二叉树层次遍历应该都很熟悉了，就不多说了

算法描述

• Step1：如果根节点root为空，返回0
• Step2：如果不为空，把root放入队列了，初始化最大值为root的数据值，数据和最大的层数初始化为1
• Step3：然后按照二叉树层次遍历，计算每层数据和，和记录的最大值作比较，如果比已记录的最大值还要大，就更新最大值和最大值所在的层数
• Step4：最后返回最大值所在层数

代码实现-Java

class Solution {
    public int maxLevelSum(TreeNode root) {
        if (root == null) {
            return 0;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int maxLevel=1, curLevel = 0;
        int max = root.val;
        int sum = 0;
        while(!queue.isEmpty()){
            int size = queue.size();
            curLevel++;
            sum = 0;
            for(int i=0;i<size;i++){
                TreeNode tmp = queue.poll();
                sum += tmp.val;
                if(tmp.left != null){
                    queue.offer(tmp.left);
                }
                if(tmp.right != null){
                    queue.offer(tmp.right);
                }
            }
            if(sum > max){
                max = sum;
                maxLevel = curLevel;
            }
        }
        return maxLevel;
    }
}

运行结果数据

Runtime: 9 ms, faster than 80.47% of Java online submissions for Maximum Level Sum of a Binary Tree. Memory Usage: 39.6 MB, less than 100.00% of Java online submissions for Maximum Level Sum of a Binary Tree.