Update 0513.找树左下角的值.md -添加C#迭代法

This commit is contained in:
Chenxue3
2024-01-15 23:10:46 +13:00
parent 29eb6f680f
commit 47688ba248

View File

@ -716,9 +716,55 @@ public void Traversal(TreeNode root, int depth)
return;
}
```
```csharp
/*
* @lc app=leetcode id=513 lang=csharp
* 迭代法
* [513] Find Bottom Left Tree Value
*/
// @lc code=start
public class Solution
{
public int FindBottomLeftValue(TreeNode root)
{
Queue<TreeNode> que = new Queue<TreeNode>();
if (root != null)
{
que.Enqueue(root);
}
int ans = 0;
while (que.Count != 0)
{
int size = que.Count;
for (var i = 0; i < size; i++)
{
var curNode = que.Peek();
que.Dequeue();
if(i == 0){
ans = curNode.val;
}
if (curNode.left != null)
{
que.Enqueue(curNode.left);
}
if (curNode.right != null)
{
que.Enqueue(curNode.right);
}
}
}
return ans;
}
}
// @lc code=end
```
<p align="center">
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>