-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
61 lines (56 loc) · 1.64 KB
/
Program.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
53
54
55
56
57
58
59
60
61
using System;
using System.Collections.Generic;
namespace MaximumAverageSubtree
{
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;
}
}
class Program
{
static void Main(string[] args)
{
TreeNode a = new TreeNode(5);
TreeNode b = new TreeNode(6);
TreeNode c = new TreeNode(1);
a.left = b;
a.right = c;
Console.WriteLine(MaximumAverageSubtree(a));
}
static double MaximumAverageSubtree(TreeNode root)
{
var sum = new List<double>();
var count = new List<double>();
GetSum(root, sum);
GetCount(root, count);
var max = double.MinValue;
for (int i = 0; i < sum.Count; i++)
max = Math.Max(max, sum[i] / count[i]);
return max;
}
static double GetSum(TreeNode node, List<double> res)
{
if(node == null)
return 0;
double sum = node.val + GetSum(node.left, res) + GetSum(node.right, res);
res.Add(sum);
return sum;
}
static double GetCount(TreeNode node, List<double> res)
{
if (node == null)
return 0;
double count = 1 + GetCount(node.left, res) + GetCount(node.right, res);
res.Add(count);
return count;
}
}
}