-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0515-FindLargestValueInEachTreeRow.cs
52 lines (47 loc) · 1.53 KB
/
0515-FindLargestValueInEachTreeRow.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
//-----------------------------------------------------------------------------
// Runtime: 248ms
// Memory Usage: 32.5 MB
// Link: https://leetcode.com/submissions/detail/371097460/
//-----------------------------------------------------------------------------
using System;
using System.Collections.Generic;
namespace LeetCode
{
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class _0515_FindLargestValueInEachTreeRow
{
public IList<int> LargestValues(TreeNode root)
{
if (root == null) return new List<int>();
var queue = new Queue<TreeNode>();
queue.Enqueue(root);
var result = new List<int>();
while (queue.Count > 0)
{
var size = queue.Count;
var max = int.MinValue;
for (int i = 0; i < size; i++)
{
var node = queue.Dequeue();
max = Math.Max(max, node.val);
if (node.left != null) queue.Enqueue(node.left);
if (node.right != null) queue.Enqueue(node.right);
}
result.Add(max);
}
return result;
}
}
}