Fixed compile

javadev · javadev · commit 949bcc652f5b · 2025-07-18T21:40:51.000+03:00
diff --git a/LeetCodeNet/G0601_0700/S0637_average_of_levels_in_binary_tree/Solution.cs b/LeetCodeNet/G0601_0700/S0637_average_of_levels_in_binary_tree/Solution.cs
@@ -40,10 +40,10 @@ private void Average(TreeNode node, int level, IList<int> count, IList<double> a
             avg[level] += (double) node.val;
         } else {
             count.Add(1);
-            avg.Add(node.val);
+            avg.Add((double) node.val);
         }
-        Average(node.left, level+1, count, avg);
-        Average(node.right, level+1, count, avg);
+        Average(node.left, level + 1, count, avg);
+        Average(node.right, level + 1, count, avg);
     }
 }
 }

Original file line number	Diff line number	Diff line change
`@@ -40,10 +40,10 @@ private void Average(TreeNode node, int level, IList<int> count, IList<double> a`
`40`	`40`	`avg[level] += (double) node.val;`
`41`	`41`	`} else {`
`42`	`42`	`count.Add(1);`
`43`		`- avg.Add(node.val);`
	`43`	`+ avg.Add((double) node.val);`
`44`	`44`	`}`
`45`		`- Average(node.left, level+1, count, avg);`
`46`		`- Average(node.right, level+1, count, avg);`
	`45`	`+ Average(node.left, level + 1, count, avg);`
	`46`	`+ Average(node.right, level + 1, count, avg);`
`47`	`47`	`}`
`48`	`48`	`}`
`49`	`49`	`}`