mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Merge pull request #1 from kingemma/kingemma-patch-1
添加 0102.二叉树的层序遍历- 637.二叉树的层平均值 C# 版本
This commit is contained in:
@ -1599,6 +1599,35 @@ impl Solution {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
#### C#:
|
||||||
|
|
||||||
|
```C# 二叉树的层平均值
|
||||||
|
public class Solution {
|
||||||
|
public IList<double> AverageOfLevels(TreeNode root) {
|
||||||
|
var result= new List<double>();
|
||||||
|
Queue<TreeNode> queue = new();
|
||||||
|
if(root !=null) queue.Enqueue(root);
|
||||||
|
|
||||||
|
while (queue.Count > 0)
|
||||||
|
{
|
||||||
|
int count = queue.Count;
|
||||||
|
double value=0;
|
||||||
|
for (int i = 0; i < count; i++)
|
||||||
|
{
|
||||||
|
var curentNode=queue.Dequeue();
|
||||||
|
value += curentNode.val;
|
||||||
|
if (curentNode.left!=null) queue.Enqueue(curentNode.left);
|
||||||
|
if (curentNode.right!=null) queue.Enqueue(curentNode.right);
|
||||||
|
}
|
||||||
|
result.Add(value/count);
|
||||||
|
}
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
```
|
||||||
|
|
||||||
## 429.N叉树的层序遍历
|
## 429.N叉树的层序遍历
|
||||||
|
|
||||||
[力扣题目链接](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/)
|
[力扣题目链接](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/)
|
||||||
|
Reference in New Issue
Block a user