|
29 | 29 | */ |
30 | 30 | publicclass_637 { |
31 | 31 |
|
32 | | -publicList<Double>averageOfLevels(TreeNoderoot) { |
33 | | -List<Double>result =newArrayList<>(); |
34 | | -if (root ==null) { |
35 | | -returnresult; |
36 | | - } |
37 | | -Queue<TreeNode>queue =newLinkedList<>(); |
38 | | -queue.offer(root); |
39 | | -while (!queue.isEmpty()) { |
40 | | -intsize =queue.size(); |
41 | | -doublesum =0.0; |
42 | | -for (inti =0;i <size;i++) { |
43 | | -TreeNodecurr =queue.poll(); |
44 | | -if (curr !=null) { |
45 | | -sum +=curr.val; |
46 | | - } |
47 | | -if (curr.left !=null) { |
48 | | -queue.offer(curr.left); |
49 | | - } |
50 | | -if (curr.right !=null) { |
51 | | -queue.offer(curr.right); |
| 32 | +publicstaticclassSolution1 { |
| 33 | +publicList<Double>averageOfLevels(TreeNoderoot) { |
| 34 | +List<Double>result =newArrayList<>(); |
| 35 | +if (root ==null) { |
| 36 | +returnresult; |
| 37 | + } |
| 38 | +Queue<TreeNode>queue =newLinkedList<>(); |
| 39 | +queue.offer(root); |
| 40 | +while (!queue.isEmpty()) { |
| 41 | +intsize =queue.size(); |
| 42 | +doublesum =0.0; |
| 43 | +for (inti =0;i <size;i++) { |
| 44 | +TreeNodecurr =queue.poll(); |
| 45 | +if (curr !=null) { |
| 46 | +sum +=curr.val; |
| 47 | + } |
| 48 | +if (curr.left !=null) { |
| 49 | +queue.offer(curr.left); |
| 50 | + } |
| 51 | +if (curr.right !=null) { |
| 52 | +queue.offer(curr.right); |
| 53 | + } |
52 | 54 | } |
| 55 | +result.add(sum /size); |
53 | 56 | } |
54 | | -result.add(sum /size); |
| 57 | +returnresult; |
55 | 58 | } |
56 | | -returnresult; |
57 | 59 | } |
58 | 60 |
|
59 | 61 | } |