LeetCode 1161. Maximum Level Sum of a Binary Tree解题报告

最新推荐文章于 2022-07-31 10:47:16 发布

orientliu96

最新推荐文章于 2022-07-31 10:47:16 发布

阅读量178

点赞数

分类专栏： LeetCode 文章标签： LeetCode python

本文链接：https://blog.csdn.net/Orientliu96/article/details/102967579

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

1161. Maximum Level Sum of a Binary Tree

Maximum Level Sum of a Binary Tree python solution

题目描述

Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
Return the smallest level X such that the sum of all the values of nodes at level X is maximal.

在这里插入图片描述

解析

思路比较简单，递归运算，计算每一级的val之和。这里需要使用counter函数，可以简化程序的编写。counter函数可以统计数组中，字符出现的次数。
在这里插入图片描述

// An highlighted block
from collections import Counter
class Solution:
    def maxLevelSum(self, root: TreeNode) -> int:
        def dfs(node,level):
            if not node:return
            value[level]+=node.val
            dfs(node.left,level+1)
            dfs(node.right,level+1)
        
        value=Counter()
        dfs(root,1)
        return value.most_common()[0][0]

Reference

https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/discuss/395272/python-dfs-and-bfs
https://blog.csdn.net/qq_24753293/article/details/78334140