mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
32 lines
1.1 KiB
HTML
32 lines
1.1 KiB
HTML
<p>Given the <code>root</code> of a binary tree, the level of its root is <code>1</code>, the level of its children is <code>2</code>, and so on.</p>
|
|
|
|
<p>Return the <strong>smallest</strong> level <code>x</code> such that the sum of all the values of nodes at level <code>x</code> is <strong>maximal</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2019/05/03/capture.JPG" style="width: 200px; height: 175px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [1,7,0,7,-8,null,null]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation: </strong>
|
|
Level 1 sum = 1.
|
|
Level 2 sum = 7 + 0 = 7.
|
|
Level 3 sum = 7 + -8 = -1.
|
|
So we return the level with the maximum sum which is level 2.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> root = [989,null,10250,98693,-89388,null,null,null,-32127]
|
|
<strong>Output:</strong> 2
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.</li>
|
|
<li><code>-10<sup>5</sup> <= Node.val <= 10<sup>5</sup></code></li>
|
|
</ul>
|