-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1120.java
40 lines (36 loc) · 1.1 KB
/
1120.java
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
__________________________________________________________________________________________________
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
double res = 0;
public double maximumAverageSubtree(TreeNode root) {
solve(root);
return res;
}
int[] solve(TreeNode root) {
int[] res = new int[2];
res[0] = 1;
res[1] = root.val;
if (root.left != null) {
int[] tmp = solve(root.left);
res[0] += tmp[0];
res[1] += tmp[1];
}
if (root.right != null) {
int[] tmp = solve(root.right);
res[0] += tmp[0];
res[1] += tmp[1];
}
this.res = Math.max(this.res, 1.0 * res[1] / res[0]);
return res;
}
}
__________________________________________________________________________________________________
__________________________________________________________________________________________________